A note on the Erdős--Farber--Lovász conjecture

DOI10.1016/j.disc.2005.11.053zbMath1114.05035OpenAlexW2050258148WikidataQ123152121 ScholiaQ123152121MaRDI QIDQ868363

Bill Jackson, G. Sethuraman, Carol A. Whitehead

Publication date: 2 March 2007

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

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

zbMATH Keywords

hypergraphedge-coloring

Mathematics Subject Classification ID

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

Related Items

Unnamed Item ⋮ ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ \(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 ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item