Article
Semidefinite Programming and Ramsey Numbers
arxiv
Document Type
Article
Disciplines
Publication Version
Submitted Manuscript
Publication Date
4-12-2017
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.
Copyright Owner
The Authors
Copyright Date
2017
Language
en
File Format
application/pdf
Citation Information
Bernard Lidicky and Florian Pfender. "Semidefinite Programming and Ramsey Numbers" arxiv (2017) Available at: http://works.bepress.com/bernard-lidicky/51/
This is a manuscript made available through arxiv: https://arxiv.org/abs/1704.03592.