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

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

2007-07-02

arxiv.org/abs/0707.0315v1

Mathematics

Combinatorics

Scientific paper

We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. We obtain a tight bound on the number of random edges required to ensure non-2-colorability. We prove that for any k-uniform hypergraph with Omega(n^{k-epsilon}) edges, adding omega(n^{k epsilon/2}) random edges makes the hypergraph almost surely non-2-colorable. This is essentially tight, since there is a 2-colorable hypergraph with Omega(n^{k-\epsilon}) edges which almost surely remains 2-colorable even after adding o(n^{k \epsilon / 2}) random edges.

Affiliated with

Also associated with

No associations

Rating

How many random edges make a dense hypergraph non-2-colorable? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How many random edges make a dense hypergraph non-2-colorable?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How many random edges make a dense hypergraph non-2-colorable? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178825