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

Massimo Lauria

doi:10.1007/978-3-642-39071-5_26

ScienceGate Book Chapters

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

DOI: 10.1007/978-3-642-39071-5_26

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematical proof Rank (graph theory) Mathematics Ramsey's theorem Ramsey theory Combinatorics Upper and lower bounds Geometry Mathematical analysis Graph

Metrics

Cited By

0.60

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

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

Input Proofs and Rank One Cutting Planes

WITHDRAWN: On Chvátal rank and cutting planes proofs

Lower bounds for cutting planes proofs with small coefficients

Lower bounds for cutting planes proofs with small coefficients