Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas |
scientific article; zbMATH DE number 3987323
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas |
scientific article; zbMATH DE number 3987323 |
Statements
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (English)
0 references
1986
0 references
The authors prove (using transversal theory) infinite versions of the result due to P. D. Seymour (minimal non-two-colorable hypergraph on n vertices has at least n edges) and an unpublished result of M. Tarsi. They give a characterization of the structure of minimal unsatisfiable CNF formulas in n variables containing exactly \(n+1\) clauses and its geometrical interpretation.
0 references
minimal unsatisfiable formulae
0 references
minimal non-two-colorable hypergraph
0 references
König's duality theorem
0 references
transversal theory
0 references
