TY - GEN
T1 - Coloring uniform hypergraphs with small edge degrees
AU - Kostochka, Alexandr V.
AU - Kumbhat, Mohit
AU - Rödl, Vojtěch
PY - 2010
Y1 - 2010
N2 - Let k be a positive integer and n = [log2 k] We prove that there is an ε = ε(k) > 0 such that for sufficiently large r, every r-uniform hypergraph with maximum edge degree at most ε(k)k r(r/In r)n/n+1 is k-colorable.
AB - Let k be a positive integer and n = [log2 k] We prove that there is an ε = ε(k) > 0 such that for sufficiently large r, every r-uniform hypergraph with maximum edge degree at most ε(k)k r(r/In r)n/n+1 is k-colorable.
UR - http://www.scopus.com/inward/record.url?scp=80955168399&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80955168399&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-13580-4_9
DO - 10.1007/978-3-642-13580-4_9
M3 - Conference contribution
AN - SCOPUS:80955168399
SN - 9783642135798
T3 - Bolyai Society Mathematical Studies
SP - 213
EP - 238
BT - Fete of Combinatorics and Computer Science
T2 - Meeting on Fete of Combinatorics and Computer Science
Y2 - 11 August 2008 through 15 August 2008
ER -