ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE

DOI10.1142/S1793830912500036zbMath1247.05086OpenAlexW2136545669WikidataQ122932378 ScholiaQ122932378MaRDI QIDQ2905303

K. A. Germina, Viji Paul

Publication date: 27 August 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830912500036

zbMATH Keywords

chromatic indexErdős-Faber-Lovász conjecture

Mathematics Subject Classification ID

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

Related Items (8)

Unnamed Item ⋮ 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 ⋮ Lower bounds on circuit depth of the quantum approximate optimization algorithm ⋮ New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture ⋮ Further results on Erdős–Faber–Lovász conjecture ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• The Erdős-Faber-Lovász conjecture -- the uniform regular case
• A note on the Erdős--Farber--Lovász conjecture
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• 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
• A fractional version of the Erdős-Faber-Lovász conjecture
• 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

This page was built for publication: ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE