Normal hypergraphs and the perfect graph conjecture. (Reprint)

DOI10.1016/j.disc.2006.03.007zbMath1095.05027OpenAlexW4210497992WikidataQ122965177 ScholiaQ122965177MaRDI QIDQ2497986

László Lovász

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.007

Mathematics Subject Classification ID

Linear programming (90C05) Hypergraphs (05C65) Perfect graphs (05C17)

Related Items (6)

Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement ⋮ Non-separating subgraphs after deleting many disjoint paths ⋮ A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem ⋮ A weaker version of Lovász' path removal conjecture ⋮ Polyhedral results on the stable set problem in graphs containing even or odd pairs ⋮ Box-total dual integrality, box-integrality, and equimodular matrices

Cites Work

• Anti-blocking polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Normal hypergraphs and the perfect graph conjecture. (Reprint)