TY - JOUR
T1 - The chromatic numbers of random hypergraphs
AU - Krivelevich, Michael
AU - Sudakov, Benny
PY - 1998/7
Y1 - 1998/7
N2 - For a pair of integers 1 ≤ γ < r, the γ-chromatic number of an r-uniform hypergraph H = (V, E) is the minimal k, for which there exists a partition of V into subsets T1, . . . , Tk such that |e ∩ Ti| ≤ γ for every e ∈ E. In this paper we determine the asymptotic behavior of the γ-chromatic number of the random r-uniform hypergraph Hr(n, p) for all possible values of γ and for all values of p down to p = Θ(n-r+1).
AB - For a pair of integers 1 ≤ γ < r, the γ-chromatic number of an r-uniform hypergraph H = (V, E) is the minimal k, for which there exists a partition of V into subsets T1, . . . , Tk such that |e ∩ Ti| ≤ γ for every e ∈ E. In this paper we determine the asymptotic behavior of the γ-chromatic number of the random r-uniform hypergraph Hr(n, p) for all possible values of γ and for all values of p down to p = Θ(n-r+1).
KW - Chromatic number
KW - Random hypergraphs
UR - http://www.scopus.com/inward/record.url?scp=0032345521&partnerID=8YFLogxK
U2 - 10.1002/(SICI)1098-2418(199807)12:4<381::AID-RSA5>3.0.CO;2-P
DO - 10.1002/(SICI)1098-2418(199807)12:4<381::AID-RSA5>3.0.CO;2-P
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0032345521
SN - 1042-9832
VL - 12
SP - 381
EP - 403
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 4
ER -