Coloring H-free hypergraphs
From MaRDI portal
Publication:3055875
DOI10.1002/rsa.20298zbMath1205.05082arXiv0901.2061OpenAlexW2952808951WikidataQ57401460 ScholiaQ57401460MaRDI QIDQ3055875
Dhruv Mubayi, Tom Bohman, Alan M. Frieze
Publication date: 10 November 2010
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.2061
Related Items
List coloring triangle-free hypergraphs ⋮ The independent neighborhoods process ⋮ Trees in greedy colorings of hypergraphs ⋮ Bounds on Ramsey games via alterations ⋮ Improved algorithms for colorings of simple hypergraphs and applications ⋮ Erdős-Hajnal problem for \(H\)-free hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Lower bounds for the number of edges in hypergraphs of certain classes ⋮ Defective coloring of hypergraphs ⋮ Sparse hypergraphs with low independence number ⋮ On \(r\)-chromatic hypergraphs ⋮ On the chromatic number of simple triangle-free triple systems ⋮ Trees and $n$-Good Hypergraphs ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász
Cites Work
- A note on embedding hypertrees
- Hypergraphs with high chromatic number
- Coloring triangle-free graphs with fixed size
- Coloring graphs with sparse neighborhoods
- On the chromatic number of set systems
- Bounding Ramsey numbers through large deviation inequalities
- On Brooks' Theorem for Sparse Graphs
- Improved bounds and algorithms for hypergraph 2-coloring