Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges
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
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.