Graph and hypergraph colouring via nibble methods: a survey
From MaRDI portal
Publication:6086395
DOI10.4171/8ecm/11arXiv2106.13733OpenAlexW3174655151MaRDI QIDQ6086395
Dong Yeap Kang, Abhishek Methuku, Daniela Kühn, Deryk Osthus, Tom Kelly
Publication date: 10 November 2023
Published in: European Congress of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.13733
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Nearly-perfect hypergraph packing is in NC
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- Hypergraph containers
- The Erdős-Faber-Lovász conjecture -- the uniform regular case
- On the fractional matching polytope of a hypergraph
- Hanani triple systems
- Asymptotic behavior of the chromatic index for hypergraphs
- Asymmetric list sizes in bipartite graphs
- On the chromatic number of simple triangle-free triple systems
- A note on the independence number of triangle-free graphs
- On a packing and covering problem
- The chromatic index of simple hypergraphs
- Near perfect coverings in graphs and hypergraphs
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- More-than-nearly-perfect packings and partial designs
- Asymptotics of the chromatic index for multigraphs
- A note on Ramsey numbers
- A dense infinite Sidon sequence
- Extremal uncrowded hypergraphs
- On the combinatorial problems which I would most like to see solved
- On Turan's theorem for sparse graphs
- Packing nearly-disjoint sets
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- On the independence and chromatic numbers of random regular graphs
- A note on the independence number of triangle-free graphs. II
- A fractional version of the Erdős-Faber-Lovász conjecture
- Transversals of latin squares and their generalizations
- The choice number of random bipartite graphs
- Fractional v. integral covers in hypergraphs of bounded edge size
- Nearly perfect matchings in regular simple hypergraphs
- An infinite Sidon sequence
- Coloring graphs with sparse neighborhoods
- The list chromatic number of graphs with small clique number
- Sparse hypergraphs with low independence number
- Matchings and covers in hypergraphs
- Asymptotically good list-colorings
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- Resolution of the Oberwolfach problem
- Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- Number of 1-factorizations of regular high-degree graphs
- Decompositions into isomorphic rainbow spanning trees
- Infinite Sidon sequences
- On a hypergraph matching problem
- On the chromatic number of Latin square graphs
- Coloring Sparse Hypergraphs
- Recent advances on Dirac-type problems for hypergraphs
- A counterexample to Borsuk’s conjecture
- Some old and new problems in combinatorial geometry I: around Borsuk's problem
- List coloring triangle-free hypergraphs
- Embedding large subgraphs into dense graphs
- The NP-Completeness of Edge-Coloring
- The Independence Ratio of Regular Graphs
- On the Size of a Maximum Transversal in a Steiner Triple System
- A Lower Bound for Heilbronn'S Problem
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
- Near-optimal list colorings
- Long gaps between primes
- On the average size of independent sets in triangle-free graphs
- Steiner Triple Systems with High Chromatic Index
- A Stronger Bound for the Strong Chromatic Index
- A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture
- On uncrowded hypergraphs
- Independence numbers of locally sparse graphs and a Ramsey type problem
- On Representatives of Subsets
- Asymptotic packing via a branching process
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On the independence number of sparse graphs
- On Brooks' Theorem for Sparse Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
- Pseudorandom hypergraph matchings
- New bounds for Ryser’s conjecture and related problems
- The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
- HYPERGRAPH MATCHINGS AND DESIGNS
- Rainbow structures in locally bounded colorings of graphs
- Coloring triangle‐free graphs with local list sizes
- A natural barrier in random greedy hypergraph matching
- The Johansson‐Molloy theorem for DP‐coloring
- Edge‐coloring linear hypergraphs with medium‐sized edges
- Paths, Trees, and Flowers
- Independent sets, matchings, and occupancy fractions
- The Chromatic Index of Projective Triple Systems
- Two Chromatic Conjectures: One for Vertices and One for Edges
- Maximum matching and a polyhedron with 0,1-vertices
- The Factorization of Linear Graphs
- A Theorem on Coloring the Lines of a Network
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- Optimal path and cycle decompositions of dense quasirandom graphs
- Graph colouring and the probabilistic method
- On the degree, size, and chromatic index of a uniform hypergraph
- Dynamic concentration of the triangle‐free process
- Asymptotically good edge correspondence colourings
- A proof of the Erdős-Faber-Lovász conjecture
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graph and hypergraph colouring via nibble methods: a survey
