From conjecture to theorem (Q2758331)
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: From conjecture to theorem |
scientific article; zbMATH DE number 1679715
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From conjecture to theorem |
scientific article; zbMATH DE number 1679715 |
Statements
16 April 2002
0 references
weak perfect graph conjecture
0 references
strong perfect graph conjecture
0 references
Gallai graphs
0 references
polyhedral combinatorics
0 references
From conjecture to theorem (English)
0 references
In this survey it is proved that triangulated graphs and their complements are perfect. Two proofs of the weak perfect graph conjecture and their polyhedral and algebraic consequences are discussed. In particular, it is shown that Lovász's proof of the weak perfect graph conjecture pointed out the fundamental role that perfect graphs play in polyhedral combinatorics.NEWLINENEWLINEFor the entire collection see [Zbl 0972.00015].
0 references
0.8561125993728638
0 references
0.8528764247894287
0 references
0.8432078957557678
0 references
