Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0097-3165(86)90060-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015211698 / rank | |||
Normal rank | |||
Revision as of 01:39, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas |
scientific article |
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
