Coloring unions of nearly disjoint hypergraph cliques
From MaRDI portal
Publication:6144279
DOI10.1112/mtk.12234arXiv2304.04855MaRDI QIDQ6144279
Jacques Verstraete, Dhruv Mubayi
Publication date: 29 January 2024
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2304.04855
Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- The de Bruijn-Erdős theorem for hypergraphs
- On a packing and covering problem
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- Extremal uncrowded hypergraphs
- On the combinatorial problems which I would most like to see solved
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- Coloring Sparse Hypergraphs
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- Note on independent sets in steiner systems
- Counting Independent Sets in Hypergraphs
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- A proof of the Erdős-Faber-Lovász conjecture
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Coloring unions of nearly disjoint hypergraph cliques
