Defective coloring of hypergraphs

DOI10.1002/rsa.21190arXiv2207.10514OpenAlexW4387973287MaRDI QIDQ6201037

David R. Wood, António Girão, Alexander D. Scott, Freddie Illingworth

Publication date: 25 March 2024

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.10514

zbMATH Keywords

Lovász local lemma\((r+1)\)-uniform hypergraphsgrah coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On judicious partitions of uniform hypergraphs
• Judicious partitions of uniform hypergraphs
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious \(k\)-partitions of graphs
• On the chromatic number of simple triangle-free triple systems
• Maximum cuts and judicious partitions in graphs without short cycles
• Sparse hypergraphs with low independence number
• Defective and clustered graph colouring
• Randomly coloring simple hypergraphs
• Thresholds versus fractional expectation-thresholds
• Note on sunflowers
• Improved bounds for the sunflower lemma
• On judicious partitions of hypergraphs with edges of size at most 3
• Coloring Sparse Hypergraphs
• Conflict-Free Colourings of Uniform Hypergraphs With Few Edges
• Coloring uniform hypergraphs with few edges
• Coloring H-free hypergraphs
• Intersection Theorems for Systems of Sets
• List coloring triangle-free hypergraphs
• A Relative of Hadwiger's Conjecture
• Constructive Proofs of Concentration Bounds
• Judicious partitions of bounded‐degree graphs
• Improper colourings inspired by Hadwiger's conjecture
• Problems and results on judicious partitions
• A General Framework for Hypergraph Coloring
• Coding for Sunflowers
• Partitions of hypergraphs under variable degeneracy constraints