A lower bound on the Chvátal-rank of Antiwebs

DOI10.1016/j.endm.2011.05.065zbMath1268.05220OpenAlexW1993744364MaRDI QIDQ2840740

Eugenia Holm, Luis M. Torres, Annegret K. Wagler

Publication date: 23 July 2013

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

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.065

zbMATH Keywords

stable setspolyhedral combinatoricsChvátal-rank

Mathematics Subject Classification ID

Applications of graph theory (05C90) Other combinatorial number theory (11B75)

Cites Work

• On cutting-plane proofs in combinatorial optimization
• A class of facet producing graphs for vertex packing polyhedra
• Antiwebs are rank-perfect
• Edmonds polytopes and a hierarchy of combinatorial problems
• On the Chvátal-rank of Antiwebs
• On the Chvátal rank of linear relaxations of the stable set polytope
• Elementary Number Theory

This page was built for publication: A lower bound on the Chvátal-rank of Antiwebs