A coloring problem related to the Erdős, Faber, Lovasz conjecture

DOI10.1016/0095-8956(90)90087-GzbMath0668.05029DBLPjournals/jct/Horak90OpenAlexW1979800719WikidataQ56390945 ScholiaQ56390945MaRDI QIDQ1117945

Zsolt Tuza, Peter Horák

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90087-g

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Motivations and history of some of my conjectures ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022

Cites Work

• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• On the combinatorial problems which I would most like to see solved

This page was built for publication: A coloring problem related to the Erdős, Faber, Lovasz conjecture