Normal hypergraphs and the perfect graph conjecture. (Reprint)

DOI10.1016/J.DISC.2006.03.007zbMATH Open1095.05027OpenAlexW4210497992WikidataQ122965177 ScholiaQ122965177MaRDI QIDQ2497986FDOQ2497986

Authors: 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

Recommendations

• Norms and perfect graphs
• A note on perfect graphs
• Progress on perfect graphs
• On the odd cycles of normal graphs
• scientific article; zbMATH DE number 2073528

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Anti-blocking polyhedra
• Title not available (Why is that?)

Cited In (15)

• Disproving the normal graph conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of normal fraternally orientable perfect graphs
• A weaker version of Lovász' path removal conjecture
• A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem
• Normality of semigroups with some links to graph theory.
• Box-total dual integrality, box-integrality, and equimodular matrices
• Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
• Perfect graphs and norms
• Integral sum graphs G _n and G _-r,n are perfect graphs
• Polyhedral results on the stable set problem in graphs containing even or odd pairs
• Non-separating subgraphs after deleting many disjoint paths
• The normal graph conjecture for two classes of sparse graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497986)