Adding evidence to the Erdős-Faber-Lovász conjecture

zbMATH Open1224.05187MaRDI QIDQ3070194FDOQ3070194

Authors: David Romero, Abdón Sánchez-Arroyo 

Publication date: 2 February 2011

Recommendations

• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\)
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A note on the Erdős--Farber--Lovász conjecture

zbMATH Keywords

linear hypergraphErdos-Faber-Lovasz conjecture

Mathematics Subject Classification ID

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

Cited In (10)

• A note on Erdős-Faber-Lovász conjecture and edge coloring of complete graphs.
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Advances on the Erdős-Faber-Lovász conjecture
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fractional version of the Erdős-Faber-Lovász conjecture
• The Erdős-Faber-Lovász conjecture revisited
• The Erdős-Faber-Lovász conjecture is true for \(n \leq 12\)
• New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture

This page was built for publication: Adding evidence to the Erdős-Faber-Lovász conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070194)