Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the 2-Colorability of Random Hypergraphs Dimitris Achlioptas and Cristopher Moore
 

Summary: On the 2-Colorability of Random Hypergraphs
Dimitris Achlioptas and Cristopher Moore
1
Microsoft Research, Redmond, Washington optas@microsoft.com
2
Computer Science Department, University of New Mexico, Albuquerque and the
Santa Fe Institute, Santa Fe, New Mexico moore@cs.unm.edu
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.
1 Introduction
For an integer k 2, a k-uniform hypergraph H is an ordered pair H = (V, E),
where V is a finite non-empty set, called the set of vertices of H, and E is a
family of distinct k-subsets of V , called the edges of H. For general hypergraph
terminology and background see [5]. A 2-coloring of a hypergraph H = (V, E)

  

Source: Achlioptas, Dimitris - Department of Computer Engineering, University of California at Santa Cruz

 

Collections: Computer Technologies and Information Sciences