A General Framework for Hypergraph Coloring
From MaRDI portal
Publication:5093586
DOI10.1137/21M1421015zbMath1493.05119MaRDI QIDQ5093586
Publication date: 28 July 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strict bounds for pattern avoidance
- On hypergraph cliques with chromatic number 3
- Nonrepetitive colouring via entropy compression
- Further applications of a power series method for pattern avoidance
- Nonrepetitive vertex colorings of graphs
- Polynomial treewidth forces a large grid-like-minor
- Many 3-colorings of triangle-free planar graphs
- Exponentially many 5-list-colorings of planar graphs
- Nonrepetitive colorings of graphs -- a survey
- Hypergraphs with high chromatic number
- On 3-chromatic hypergraphs
- Ramsey's theorem - a new lower bound
- On complete subgraphs of \(r\)-chromatic graphs
- Asymptotic lower bounds for Ramsey functions
- Colouring a graph frugally
- Probabilistic methods in coloring and decomposition problems
- Independent transversals in \(r\)-partite graphs
- Asymptotically the list colouring constants are 1
- Entropy compression versus Lovász local lemma
- Another approach to non-repetitive colorings of graphs of bounded degree
- Every 8-uniform 8-regular hypergraph is 2-colorable
- Acyclic coloring of graphs and entropy compression method
- On the construction of 3-chromatic hypergraphs with few edges
- The local cut lemma
- Independent transversals in locally sparse graphs
- On the number of solutions in random hypergraph 2-colouring
- Do triangle-free planar graphs have exponentially many 3-colorings?
- Acyclic edge-coloring using entropy compression
- Doubled patterns are 3-avoidable
- An average degree condition for independent transversals
- A Note on Vertex List Colouring
- Greedy colorings of uniform hypergraphs
- An Improvement of the Lovász Local Lemma via Cluster Expansion
- Independent Transversals and Independent Coverings in Sparse Partite Graphs
- Star coloring of graphs
- A Sharper Local Lemma with Improved Applications
- The Number of Satisfying Assignments of Random Regulark-SAT Formulas
- The Local Lemma Is Asymptotically Tight for SAT
- A constructive proof of the general lovász local lemma
- The Lovász Local Lemma and Satisfiability
- On critical 3-chromatic hypergraphs
- Independent Transversals in Sparse Partite Hypergraphs
- Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces
- On a list coloring conjecture of Reed
- Nonrepetitive colorings of graphs
- Improved Bounds for Centered Colorings
- On the Number of Solutions in Random Graphk-Colouring
- Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma
- Colorings of hypergraphs with large number of colors
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
- Graph colouring and the probabilistic method
- Single‐conflict colouring
- Colorings, transversals, and local sparsity
This page was built for publication: A General Framework for Hypergraph Coloring
