Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges - Computer Science > Discrete MathematicsReportar como inadecuado




Construction of a Non-2-colorable k-uniform Hypergraph with Few Edges - Computer Science > Discrete Mathematics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: We show how to construct a non-2-colorable k-uniform hypergraph with 2^1 +o1^k edges. By the duality of hypergraphs and monotone k-CNF-formulas thisgives an unsatisfiable monotone k-CNF with 2^1 + o1^k clauses



Autor: Heidi Gebauer

Fuente: https://arxiv.org/







Documentos relacionados