Back to Search
Start Over
Coloring simple hypergraphs.
- Source :
-
Journal of Combinatorial Theory - Series B . Nov2013, Vol. 103 Issue 6, p767-794. 28p. - Publication Year :
- 2013
-
Abstract
- Fix an integer . A k-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant c depending only on k such that every simple k-uniform hypergraph H with maximum degree Δ has chromatic number satisfying This implies a classical result of Ajtai, Komlós, Pintz, Spencer and Szemerédi and its strengthening due to Duke, Lefmann and Rödl. The result is sharp apart from the constant c. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00958956
- Volume :
- 103
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Journal of Combinatorial Theory - Series B
- Publication Type :
- Academic Journal
- Accession number :
- 92029754
- Full Text :
- https://doi.org/10.1016/j.jctb.2013.09.003