The chromatic index of simple hypergraphs

DOI10.1007/BF01788081zbMath0589.05036OpenAlexW2009863039MaRDI QIDQ1073804

Zoltan Fueredi

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788081

zbMATH Keywords

hypergraphmatching numberchromatic indexErdős-Faber-Lovász conjectureneighborhood of a vectorVizing's Theorem

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item ⋮ Motivations and history of some of my conjectures ⋮ A method of finding automorphism groups of endomorphism monoids of relational systems. ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs ⋮ Unnamed Item ⋮ A sharpening of Fisher's inequality ⋮ A fractional version of the Erdős-Faber-Lovász conjecture ⋮ Chromatic index of simple hypergraphs ⋮ The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ The Erdős–Faber–Lovász conjecture for the class of δEFL graphs

Cites Work

• Unnamed Item
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• Packing nearly-disjoint sets
• The chromatic index of cyclic Steiner 2-designs
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings