Constructions of sparse uniform hypergraphs with high chromatic number
type: Item
instance of: scholarly article
title: Constructions of sparse uniform hypergraphs with high chromatic number
zbMATH Open document ID: 1208.05094
author: Vojtěch Rödl
author: Alexandr Kostochka
publication date: 2010-11-10T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5814440
zbMATH Keywords: girth
zbMATH Keywords: simple hypergraphs
zbMATH Keywords: hypergraph coloring
MaRDI profile type: Publication
full work available at URL: rsa.20293
OpenAlex ID: W3083407599
cites work: Hypergraphs with high chromatic number
cites work: Coloring uniform hypergraphs with few edges
cites work: Q3858291
cites work: On the chromatic number of set systems
cites work: On the difference between asymptotically good packings and coverings
cites work: Improved bounds and algorithms for hypergraph 2-coloring
cites work: On the existence of regular n-graphs with given girth
cites work: On the lower bound for the chromatic number of graphs with given maximal degree and girth
DOI: 10.1002/RSA.20293
published in: Random Structures \& Algorithms
description: scientific article