On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs

DOI10.1016/j.disc.2020.112059zbMath1447.05145OpenAlexW3044140084MaRDI QIDQ2198387

François Hennecart, Alain Bretto, Alain Faisant

Publication date: 10 September 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.112059

zbMATH Keywords

hypergraphErdős-Faber-Lovász conjectureBerge-Füredi conjecturehyperedge coloring

Mathematics Subject Classification ID

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

Related Items (2)

Applying a hypergraph to determine the structure of some finite modules ⋮ Unnamed Item

Cites Work

• The chromatic index of simple hypergraphs
• On the combinatorial problems which I would most like to see solved
• The chromatic index of cyclic Steiner 2-designs
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Chromatic index of hypergraphs and Shannon's theorem
• Hypergraph theory. An introduction
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• A remark on the conjecture of Erdös, Faber and Lovász
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs