Abstract
LetK(k)(n,p) be the randomk-uniform hypergraph obtained by independent inclusion of each of the[formula]k-tuples with probabilityp. For an arbitraryk-uniform hypergraphGand every integerrwe find the threshold for the property that everyr-coloring of the vertices ofK(k)(n,p) results in a monochromatic copy ofG. In the edge coloring case, which is of our main interest, we find the threshold only fork=3,r=2, andG=K34. In the proof we utilize a recent version of the hypergraph regularity lemma due to Frankl and Rödl.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
