{"title":"Bounds on Small Ramsey Numbers by Semidefinite Programming","authors":"Bernard Lidický, Florian Pfender","doi":"10.1137/25m1827554","DOIUrl":null,"url":null,"abstract":"SIAM Review, Volume 68, Issue 2, Page 385-403, June 2026. <br/> Abstract.Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method introduced by Razborov in 2007 was developed to find asymptotic results for very large graphs, so it seems that the method should not be suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper. We find new upper bounds for many small graph and hypergraph Ramsey numbers. As a result, we prove several exact values. The main power of the method relies on utilizing semidefinite programming to find certificates that are sums of squares. We hope that this technique will be adapted to address other questions for smaller graphs with the flag algebra method.","PeriodicalId":49525,"journal":{"name":"SIAM Review","volume":"33 1","pages":"385-403"},"PeriodicalIF":8.2000,"publicationDate":"2026-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Review","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/25m1827554","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Review, Volume 68, Issue 2, Page 385-403, June 2026. Abstract.Finding exact Ramsey numbers is a problem typically restricted to relatively small graphs. The flag algebra method introduced by Razborov in 2007 was developed to find asymptotic results for very large graphs, so it seems that the method should not be suitable for finding small Ramsey numbers. But this intuition is wrong, and we will develop a technique to do just that in this paper. We find new upper bounds for many small graph and hypergraph Ramsey numbers. As a result, we prove several exact values. The main power of the method relies on utilizing semidefinite programming to find certificates that are sums of squares. We hope that this technique will be adapted to address other questions for smaller graphs with the flag algebra method.
期刊介绍:
Survey and Review feature papers that provide an integrative and current viewpoint on important topics in applied or computational mathematics and scientific computing. These papers aim to offer a comprehensive perspective on the subject matter.
Research Spotlights publish concise research papers in applied and computational mathematics that are of interest to a wide range of readers in SIAM Review. The papers in this section present innovative ideas that are clearly explained and motivated. They stand out from regular publications in specific SIAM journals due to their accessibility and potential for widespread and long-lasting influence.