The Erdős-Faber-Lovász conjecture -- the uniform regular case
From MaRDI portal
Publication:543987
DOI10.4310/JOC.2010.v1.n2.a2zbMath1225.05190WikidataQ122972283 ScholiaQ122972283MaRDI QIDQ543987
Publication date: 14 June 2011
Published in: Journal of Combinatorics (Search for Journal in Brave)
Related Items (10)
Unnamed Item ⋮ 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 ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The Erdős–Faber–Lovász conjecture for the class of δEFL graphs
This page was built for publication: The Erdős-Faber-Lovász conjecture -- the uniform regular case
