Semidefinite Programming and Ramsey Numbersarxiv
Publication VersionSubmitted Manuscript
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 OwnerThe Authors
Citation InformationBernard 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.