The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited

DOI10.1285/i15900932v41n2p1zbMath1482.05105arXiv2103.00875OpenAlexW4323366753MaRDI QIDQ5027676

Jean Paul Zerafa, John Baptist Gauci

Publication date: 7 February 2022

Full work available at URL: https://arxiv.org/abs/2103.00875

zbMATH Keywords

edge-colouringchromatic numberErdős-Faber-Lovász conjectureclique-decomposition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the combinatorial problems which I would most like to see solved
• A fractional version of the Erdős-Faber-Lovász conjecture
• Rainbow triangles and cliques in edge-colored graphs
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A remark on the conjecture of Erdös, Faber and Lovász
• The Erdős–Faber–Lovász conjecture is true for n ≤ 12
• A note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs
• Monochromatic Clique Decompositions of Graphs
• Further results on Erdős–Faber–Lovász conjecture
• Unnamed Item
• Unnamed Item

This page was built for publication: The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited