A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem

DOI10.1007/978-3-642-39071-5_26zbMath1390.03046OpenAlexW202109148WikidataQ61732583 ScholiaQ61732583MaRDI QIDQ5326475

Massimo Lauria

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_26

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Complexity of proofs (03F20)