BOOK-CHAPTER

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

Massimo Lauria

Year: 2013 Lecture notes in computer science Pages: 351-364   Publisher: Springer Science+Business Media
Keywords:
Mathematical proof Rank (graph theory) Mathematics Ramsey's theorem Ramsey theory Combinatorics Upper and lower bounds Geometry Mathematical analysis Graph

Metrics

1
Cited By
0.60
FWCI (Field Weighted Citation Impact)
30
Refs
0.63
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Computational Geometry and Mesh Generation
Physical Sciences →  Computer Science →  Computer Graphics and Computer-Aided Design
Advanced Graph Theory Research
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Limits and Structures in Graph Theory
Physical Sciences →  Mathematics →  Discrete Mathematics and Combinatorics

Related Documents

JOURNAL ARTICLE

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

Massimo Lauria

Journal:   ACM Transactions on Computation Theory Year: 2016 Vol: 8 (4)Pages: 1-13
JOURNAL ARTICLE

Input Proofs and Rank One Cutting Planes

John Hooker

Journal:   INFORMS Journal on Computing Year: 1989 Vol: 1 (3)Pages: 137-145
JOURNAL ARTICLE

WITHDRAWN: On Chvátal rank and cutting planes proofs

Albert AtseriasMarı́a Luisa BonetJordi Levy

Journal:   Theoretical Computer Science Year: 2004
JOURNAL ARTICLE

Lower bounds for cutting planes proofs with small coefficients

Marı́a Luisa BonetToniann PitassiRan Raz

Journal:   Journal of Symbolic Logic Year: 1997 Vol: 62 (3)Pages: 708-728
© 2026 ScienceGate Book Chapters — All rights reserved.