A general framework for hypergraph coloring
From MaRDI portal
Publication:5093586
DOI10.1137/21M1421015zbMATH Open1493.05119MaRDI QIDQ5093586FDOQ5093586
Authors: Ian M. Wanless, David R. Wood 
Publication date: 28 July 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Graph colouring and the probabilistic method
- Exponentially many 5-list-colorings of planar graphs
- Acyclic coloring of graphs and entropy compression method
- Star coloring of graphs
- Title not available (Why is that?)
- Polynomial treewidth forces a large grid-like-minor
- Title not available (Why is that?)
- Ramsey's theorem - a new lower bound
- Asymptotic lower bounds for Ramsey functions
- The local cut lemma
- Acyclic edge-coloring using entropy compression
- An improvement of the Lovász local lemma via cluster expansion
- Title not available (Why is that?)
- A constructive proof of the general Lovász local lemma
- Nonrepetitive colorings of graphs
- Nonrepetitive colouring via entropy compression
- Nonrepetitive vertex colorings of graphs
- Nonrepetitive colorings of graphs -- a survey
- On 3-chromatic hypergraphs
- Many 3-colorings of triangle-free planar graphs
- Colouring a graph frugally
- Colorings of hypergraphs with large number of colors
- Strict bounds for pattern avoidance
- Further applications of a power series method for pattern avoidance
- Hypergraphs with high chromatic number
- Every 8-uniform 8-regular hypergraph is 2-colorable
- On hypergraph cliques with chromatic number 3
- On the construction of 3-chromatic hypergraphs with few edges
- On complete subgraphs of \(r\)-chromatic graphs
- Independent transversals in \(r\)-partite graphs
- A sharper local lemma with improved applications
- Greedy colorings of uniform hypergraphs
- Independent transversals in locally sparse graphs
- Independent Transversals and Independent Coverings in Sparse Partite Graphs
- The Lovász Local Lemma and Satisfiability
- Doubled patterns are 3-avoidable
- A note on vertex list colouring
- Independent Transversals in Sparse Partite Hypergraphs
- Single‐conflict colouring
- Title not available (Why is that?)
- The number of satisfying assignments of random regular \(k\)-SAT formulas
- On critical 3-chromatic hypergraphs
- Probabilistic methods in coloring and decomposition problems
- On a list coloring conjecture of Reed
- On the number of solutions in random hypergraph 2-colouring
- 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
- Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
- Exponentially many 4-list-colorings of triangle-free graphs on surfaces
- The local lemma Is asymptotically tight for SAT
- Improved bounds for centered colorings
- Do triangle-free planar graphs have exponentially many 3-colorings?
- An average degree condition for independent transversals
- Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma
- On the number of solutions in random graph \(k\)-colouring
- Colorings, transversals, and local sparsity
Cited In (9)
- An algebraic formulation of hypergraph colorings
- Constructing graphs with no independent transversals
- A note on near-optimal coloring of shift hypergraphs
- On perfect balanced rainbow-free colorings and complete colorings of projective spaces
- Proper conflict-free coloring of graphs with large maximum degree
- Defective coloring of hypergraphs
- Chain method for panchromatic colorings of hypergraphs
- Monochromatic graph decompositions inspired by anti-Ramsey colorings
- Coloring hypergraphs from random lists
This page was built for publication: A general framework for hypergraph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093586)
