✦ LIBER ✦

Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász

✍ Scribed by W. I. Chang; E. L. Lawler

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 133 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02126801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A coloring problem related to the Erdős-

A coloring problem related to the Erdős-Faber-Lovász conjecture

✍ Peter Horák 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 80 KB

A fractional version of the Erdős-Faber-

A fractional version of the Erdős-Faber-Lovász conjecture

✍ Jeff Kahn; P. D. Seymour 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 301 KB

A remark on the conjecture of Erdös, Fab

A remark on the conjecture of Erdös, Faber and Lovász

✍ Hauke Klein; Marian Margraf 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 67 KB

On a combinatorial problem of P. Erdös a

On a combinatorial problem of P. Erdös and L. Lovász

✍ J. Beck 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 445 KB

On a problem of Erdős and Lovász: Random

On a problem of Erdős and Lovász: Random lines in a projective plane

✍ Jeff Kahn 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 244 KB

On the use of alternating chains and hyp

On the use of alternating chains and hypergraphs in edge coloring

✍ D. de Werra 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 320 KB

## Abstract Existence of some generalized edge colorings is proved by using the properties of hypergraphs as well as alternating chain methods. A general framework is given for edge colorings and some general properties of balancing are derived.