On r-chromatic hypergraphs
From MaRDI portal
Publication:658071
DOI10.1016/J.DISC.2011.10.008zbMATH Open1238.05187OpenAlexW2012072955MaRDI QIDQ658071FDOQ658071
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
Recommendations
- On chromaticity of hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- On chromatic polynomials of hypergraphs
- ON HYPERGRAPH COLOURINGS
- On the chromatic numbers of random hypergraphs
- On complete subgraphs of \(r\)-chromatic graphs
- scientific article; zbMATH DE number 3245178
- On the chromatic number of a random hypergraph
- On chromaticity of graphs
- On \(r\)-dynamic chromatic number of graphs
Cites Work
- Coloring uniform hypergraphs with few edges
- Constructions of sparse uniform hypergraphs with high chromatic number
- Title not available (Why is that?)
- On a property of families of sets
- Coloring H-free hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- Title not available (Why is that?)
- On 3-chromatic hypergraphs
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Title not available (Why is that?)
- On a combinatorial problem. II
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
- Hypergraphs with high chromatic number
- Coloring n-sets red and blue
- On the chromatic number of set systems
- Lower bounds in the combinatorial problem of Erdős and Lovász
- Greedy colorings of uniform hypergraphs
- On the chromatic number of finite systems of subsets
- Coloring uniform hypergraphs with few colors
- On proper colourings of hypergraphs using prescribed colours
- Title not available (Why is that?)
Cited In (15)
- On the Chromatic Thresholds of Hypergraphs
- A note on random greedy coloring of uniform hypergraphs
- Hypergraph coverings and local colorings
- Extremal problems in hypergraph colourings
- Coloring uniform hypergraphs with few colors
- Colorings of partial Steiner systems and their applications
- Hypergraphs with high chromatic number
- Title not available (Why is that?)
- Equitable two-colorings of uniform hypergraphs
- A contribution to the chromatic theory of uniform hypergraphs
- Coloring non-uniform hypergraphs without short cycles
- On the chromatic number of simple triangle-free triple systems
- Colourings of Uniform Hypergraphs with Large Girth and Applications
- On the chromatic number of set systems
- Colorings of hypergraphs with large number of colors
This page was built for publication: On \(r\)-chromatic hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658071)
