𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On balanced colorings of hypergraphs

✍ Scribed by A. P. Rozovskaya; M. V. Titova; D. A. Shabanov

Publisher
Springer US
Year
2010
Tongue
English
Weight
205 KB
Volume
169
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On splittable colorings of graphs and hy
On splittable colorings of graphs and hypergraphs
✍ ZoltΓ‘n FΓΌredi; Radhika Ramamurthi πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by ErdΕ‘s and GyΓ‘rfΓ‘s [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

On a class of balanced hypergraphs
On a class of balanced hypergraphs
✍ AndrΓ‘s Frank πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 986 KB

Let P be nn arborcscencc, and let F, = {U,, , I/, ). F, = { \y,, . . , V, } bc two systems consisting of directed s&paths of P. MIntmax theorems and algorithms UC proved concerning the so called bi-pcrth system (P; F,,. F, ). One can define a hypqraph to every hi-path system. The class of t hcsc "Ri

Multiply balanced edge colorings of mult
Multiply balanced edge colorings of multigraphs
✍ M. A. Bahmanian; C. A. Rodger πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 259 KB

## Abstract In this article, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge‐colored amalgamated graph so that the result is a graph in which the edges are shared out among the vertices in ways that are fair wit

A characterization of totally balanced h
A characterization of totally balanced hypergraphs
✍ JenΓΆ Lehel πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 418 KB

A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the stru