Two-coloring Random Hypergraphs

: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a vertex set V of cardinality n, where each k-subset of V is an edge of H with probability p, independently of all other k-subsets. Let m = p n k denote the expected number of edges in H. Let us say that a sequence of events n holds with high probability

• Type: Conference
• Year: 2000
• Where: ICALP
• Authors: Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
• Keywords: Edge, ICALP 2000, Probability P, Programming Languages, Random K-uniform Hypergraph