Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász

DOI10.1007/BF02126801zbMath0661.05026OpenAlexW2005432897WikidataQ56390927 ScholiaQ56390927MaRDI QIDQ1112832

W. I. Chang, Eugene L. Lawler

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02126801

zbMATH Keywords

chromatic indexsimple hypergraphconjecture of Erdős, Faber, Lovászedge coloring of hypergraphs

Mathematics Subject Classification ID

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

Related Items (20)

Unnamed Item ⋮ ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE ⋮ Motivations and history of some of my conjectures ⋮ A coloring problem related to the Erdős, Faber, Lovasz conjecture ⋮ Constructing sparse Davenport-Schinzel sequences ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Monomial invariants applied to graph coloring ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ Unnamed Item ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture ⋮ Further results on Erdős–Faber–Lovász conjecture ⋮ Chromatic index of simple hypergraphs ⋮ The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• On the combinatorial problems which I would most like to see solved
• Packing nearly-disjoint sets
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings

This page was built for publication: Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász