Semidefinite Programming and Ramsey Numbers

Date
2017-04-12
Authors
Lidicky, Bernard
Lidicky, Bernard
Pfender, Florian
Journal Title
Journal ISSN
Volume Title
Publisher
Source URI
Altmetrics
Authors
Research Projects
Organizational Units
Mathematics
Organizational Unit
Journal Issue
Series
Abstract

We use the theory of flag algebras to find new upper bounds for several small graph and hypergraph Ramsey numbers. In particular, we prove the exact values R(K−, K−, K−) = 28, R(K8, C5) = 29, R(K9, C6) = 41, R(Q3, Q3) = 13, R(K3,5, K1,6) = 17, R(C3, C5, C5) = 17, and R(K−, K−; 3) = 12, and in addition improve many additional upper bounds.

Description
<p>This is a manuscript made available through arxiv: <a href="https://arxiv.org/abs/1704.03592" target="_blank">https://arxiv.org/abs/1704.03592</a>.</p>
Keywords
Citation
Collections