A remark on the conjecture of Erdös, Faber and Lovász

DOI10.1007/S00022-007-1960-5MaRDI QIDQ2482329zbMATH OpenOpenAlexWikidataFDO

Authors Hauke Klein, Marian Margraf

Publication date 16 April 2008

Published in Journal of Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00022-007-1960-5

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Finite partial geometries (general), nets, partial spreads (51E14)

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
• A proof of the Erdős-Faber-Lovász conjecture
• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• On the Erdős-Faber-Lovász Conjecture.

Cited in

(16)

• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Fractional aspects of the Erdős-Faber-Lovász conjecture
• On the total chromatic number of Steiner systems
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
• The Erdős-Faber-Lovász conjecture is true for n 12
• scientific article; zbMATH DE number 7232795 (Why is no real title available?)
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
• A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
• The Erdős-Faber-Lovász conjecture revisited
• Further results on Erdős-Faber-Lovász conjecture
• Remarks on the abundance conjecture
• Two Chromatic Conjectures: One for Vertices and One for Edges
• A proof of the Erdős-Faber-Lovász conjecture
• A note on Lovász removable path conjecture

This page was built for publication: A remark on the conjecture of Erdös, Faber and Lovász

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