The Erdős-Faber-Lovász conjecture for dense hypergraphs

DOI10.1016/j.disc.2007.09.026zbMath1139.05025OpenAlexW1972797373WikidataQ123149658 ScholiaQ123149658MaRDI QIDQ2470471

Abdón Sánchez-Arroyo

Publication date: 14 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.026

zbMATH Keywords

chromatic numberlinear hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE ⋮ The Erdős–Faber–Lovász conjecture is true for n ≤ 12 ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited ⋮ On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture ⋮ Further results on Erdős–Faber–Lovász conjecture ⋮ The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs ⋮ Edge‐coloring linear hypergraphs with medium‐sized edges ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The Erdős–Faber–Lovász conjecture for the class of δEFL graphs

Cites Work

• On the combinatorial problems which I would most like to see solved
• 25 pretty graph colouring problems
• Unnamed Item

This page was built for publication: The Erdős-Faber-Lovász conjecture for dense hypergraphs