Two-coloring random hypergraphs
- Dimitris Achlioptas ,
- Jeong Han Kim ,
- Michael Krivelevich ,
- Prasad Tetali
MSR-TR-99-99 |
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.
MSR-TR-99-99 |
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.