Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges

Details Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges

2009-11-04

arxiv.org/abs/0911.0900v2

Computer Science

Discrete Mathematics

3 pages

Scientific paper

We show how to construct a non-2-colorable k-uniform hypergraph with (2^(1 +
o(1)))^k edges. By the duality of hypergraphs and monotone k-CNF-formulas this
gives an unsatisfiable monotone k-CNF with (2^(1 + o(1)))^k clauses

Affiliated with

Also associated with

No associations

Rating

Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges 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 Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-620872