On the 2-Colorability of Random Hypergraphs

Authors:
Dimitris Achlioptas;Cristopher Moore
Affiliations:
-;-
Venue:
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Year:
2002

Citing 3
Cited 1

Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem

Information Sciences: an International Journal
Two-coloring random hypergraphs

Random Structures & Algorithms
The Asymptotic Order of the Random k -SAT Threshold

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science

How many random edges make a dense hypergraph non-2-colorable?

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A 2-coloring of a hypergraph is a mapping from its vertices to a set of two colors such that no edge is monochromatic. Let Hk(n,m) be a random k-uniform hypergraph on n vertices formed by picking m edges uniformly, independently and with replacement. It is easy to show that if r 驴 rc = 2k-1 ln 2 - (ln 2)/2, then with high probability Hk(n,m = rn) is not 2-colorable. We complement this observation by proving that if r 驴 rc - 1 then with high probability Hk(n, m = rn) is 2-colorable.