Constructions of sparse uniform hypergraphs with high chromatic number

DOI10.1002/rsa.20293zbMath1208.05094OpenAlexW3083407599MaRDI QIDQ3055877

Vojtěch Rödl, Alexandr V. Kostochka

Publication date: 10 November 2010

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

Full work available at URL: https://doi.org/10.1002/rsa.20293

zbMATH Keywords

girthhypergraph coloringsimple hypergraphs

Mathematics Subject Classification ID

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

Related Items (18)

Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number ⋮ Random constructions of hypergraphs with large girth and without panchromatic colorings ⋮ Colorings of \(b\)-simple hypergraphs ⋮ Improved algorithms for colorings of simple hypergraphs and applications ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ Selective hypergraph colourings ⋮ Colorings of hypergraphs with large number of colors ⋮ On \(r\)-chromatic hypergraphs ⋮ Colourings of Uniform Hypergraphs with Large Girth and Applications ⋮ The Cayley isomorphism property for Cayley maps ⋮ Coloring cross-intersecting families ⋮ On the chromatic number of simple triangle-free triple systems ⋮ Coloring hypergraphs with bounded cardinalities of edge intersections ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) ⋮ \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges

Cites Work

• Unnamed Item
• Hypergraphs with high chromatic number
• On the difference between asymptotically good packings and coverings
• On the lower bound for the chromatic number of graphs with given maximal degree and girth
• On the chromatic number of set systems
• Coloring uniform hypergraphs with few edges
• Improved bounds and algorithms for hypergraph 2-coloring
• On the existence of regular n-graphs with given girth

This page was built for publication: Constructions of sparse uniform hypergraphs with high chromatic number