{"title":"对角线拉姆齐通过有效的准随机","authors":"A. Sah","doi":"10.1215/00127094-2022-0048","DOIUrl":null,"url":null,"abstract":"We improve the upper bound for diagonal Ramsey numbers to \\[R(k+1,k+1)\\le\\exp(-c(\\log k)^2)\\binom{2k}{k}\\] for $k\\ge 3$. To do so, we build on a quasirandomness and induction framework for Ramsey numbers introduced by Thomason and extended by Conlon, demonstrating optimal \"effective quasirandomness\" results about convergence of graphs. This optimality represents a natural barrier to improvement.","PeriodicalId":11447,"journal":{"name":"Duke Mathematical Journal","volume":" ","pages":""},"PeriodicalIF":2.3000,"publicationDate":"2020-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"Diagonal Ramsey via effective quasirandomness\",\"authors\":\"A. Sah\",\"doi\":\"10.1215/00127094-2022-0048\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We improve the upper bound for diagonal Ramsey numbers to \\\\[R(k+1,k+1)\\\\le\\\\exp(-c(\\\\log k)^2)\\\\binom{2k}{k}\\\\] for $k\\\\ge 3$. To do so, we build on a quasirandomness and induction framework for Ramsey numbers introduced by Thomason and extended by Conlon, demonstrating optimal \\\"effective quasirandomness\\\" results about convergence of graphs. This optimality represents a natural barrier to improvement.\",\"PeriodicalId\":11447,\"journal\":{\"name\":\"Duke Mathematical Journal\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":2.3000,\"publicationDate\":\"2020-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Duke Mathematical Journal\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1215/00127094-2022-0048\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Duke Mathematical Journal","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1215/00127094-2022-0048","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
We improve the upper bound for diagonal Ramsey numbers to \[R(k+1,k+1)\le\exp(-c(\log k)^2)\binom{2k}{k}\] for $k\ge 3$. To do so, we build on a quasirandomness and induction framework for Ramsey numbers introduced by Thomason and extended by Conlon, demonstrating optimal "effective quasirandomness" results about convergence of graphs. This optimality represents a natural barrier to improvement.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
