A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
2007
SIAM Journal on Discrete Mathematics
Preserved Fulltext
We investigate the threshold probability for the property that every r-coloring of the edges of a random binomial k-uniform hypergraph G (k) (n, p) yields a monochromatic copy of some fixed hypergraph G. In this paper we solve the problem for arbitrary k ≥ 3 and k-partite, k-uniform hypergraphs G.
doi:10.1137/060657492
fatcat:hvfs74wzcjgwnfzqumarz2jzzm