On \(r\)-chromatic hypergraphs
From MaRDI portal
Publication:658071
DOI10.1016/J.DISC.2011.10.008zbMath1238.05187OpenAlexW2012072955MaRDI QIDQ658071
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.008
Related Items (8)
A note on random greedy coloring of uniform hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Equitable two-colorings of uniform hypergraphs ⋮ Colorings of hypergraphs with large number of colors ⋮ Colourings of Uniform Hypergraphs with Large Girth and Applications ⋮ Colorings of partial Steiner systems and their applications ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ On the chromatic number of simple triangle-free triple systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds in the combinatorial problem of Erdős and Lovász
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- On the chromatic number of finite systems of subsets
- Hypergraphs with high chromatic number
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- On the chromatic number of set systems
- Greedy colorings of uniform hypergraphs
- Coloring uniform hypergraphs with few edges
- Coloring H-free hypergraphs
- Constructions of sparse uniform hypergraphs with high chromatic number
- On proper colourings of hypergraphs using prescribed colours
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Coloring uniform hypergraphs with few colors
- Improved bounds and algorithms for hypergraph 2-coloring
- On a property of families of sets
- On a combinatorial problem. II
This page was built for publication: On \(r\)-chromatic hypergraphs
