Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
From MaRDI portal
Publication:1185879
DOI10.1016/0097-3165(92)90096-DzbMath0774.05073OpenAlexW1984375054WikidataQ56390951 ScholiaQ56390951MaRDI QIDQ1185879
Publication date: 28 June 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(92)90096-d
Related Items (32)
Unnamed Item ⋮ ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE ⋮ The Dinitz problem solved for rectangles ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ A method of finding automorphism groups of endomorphism monoids of relational systems. ⋮ Constructing sparse Davenport-Schinzel sequences ⋮ A new generalization of Mantel's theorem to \(k\)-graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Near-optimal distributed edge coloring ⋮ Monomial invariants applied to graph coloring ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Lower bounds on circuit depth of the quantum approximate optimization algorithm ⋮ On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs ⋮ 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 ⋮ A counterexample to the Alon-Saks-Seymour conjecture and related problems ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ 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 ⋮ Fractional aspects of the Erdős-Faber-Lovász conjecture ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs ⋮ Near-optimal, distributed edge colouring via the nibble method ⋮ Edge‐coloring linear hypergraphs with medium‐sized edges ⋮ Chromatic index of hypergraphs and Shannon's theorem ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The Erdős–Faber–Lovász conjecture for the class of δEFL graphs ⋮ Probabilistic methods in coloring and decomposition problems
Cites Work
- Unnamed Item
- Unnamed Item
- Asymptotic behavior of the chromatic index for hypergraphs
- On a packing and covering problem
- List-colourings of graphs
- Near perfect coverings in graphs and hypergraphs
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- A new upper bound for the list chromatic number
- 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: Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
