Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges
Discrete Mathematics
2009-11-05 v2
Abstract
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
Keywords
Cite
@article{arxiv.0911.0900,
title = {Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges},
author = {Heidi Gebauer},
journal= {arXiv preprint arXiv:0911.0900},
year = {2009}
}
Comments
3 pages