{"title":"Two-Point Concentration of the Independence Number of the Random Graph","authors":"Tom Bohman, Jakob Hofstad","doi":"10.1017/fms.2024.6","DOIUrl":null,"url":null,"abstract":"We show that the independence number of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000069_inline1.png\" /> <jats:tex-math> $ G_{n,p}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> is concentrated on two values if <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000069_inline2.png\" /> <jats:tex-math> $ n^{-2/3+ \\epsilon } < p \\le 1$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in general, concentrated on two values for <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000069_inline3.png\" /> <jats:tex-math> $ p = o ( (\\log (n)/n)^{2/3} )$ </jats:tex-math> </jats:alternatives> </jats:inline-formula>. The extent of concentration of the independence number of <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000069_inline4.png\" /> <jats:tex-math> $ G_{n,p}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> for <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S2050509424000069_inline5.png\" /> <jats:tex-math> $ \\omega (1/n) < p \\le n^{-2/3}$ </jats:tex-math> </jats:alternatives> </jats:inline-formula> remains an interesting open question.","PeriodicalId":56000,"journal":{"name":"Forum of Mathematics Sigma","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2024-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Forum of Mathematics Sigma","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/fms.2024.6","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon } < p \le 1$ . This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in general, concentrated on two values for $ p = o ( (\log (n)/n)^{2/3} )$ . The extent of concentration of the independence number of $ G_{n,p}$ for $ \omega (1/n) < p \le n^{-2/3}$ remains an interesting open question.
期刊介绍:
Forum of Mathematics, Sigma is the open access alternative to the leading specialist mathematics journals. Editorial decisions are made by dedicated clusters of editors concentrated in the following areas: foundations of mathematics, discrete mathematics, algebra, number theory, algebraic and complex geometry, differential geometry and geometric analysis, topology, analysis, probability, differential equations, computational mathematics, applied analysis, mathematical physics, and theoretical computer science. This classification exists to aid the peer review process. Contributions which do not neatly fit within these categories are still welcome.
Forum of Mathematics, Pi and Forum of Mathematics, Sigma are an exciting new development in journal publishing. Together they offer fully open access publication combined with peer-review standards set by an international editorial board of the highest calibre, and all backed by Cambridge University Press and our commitment to quality. Strong research papers from all parts of pure mathematics and related areas will be welcomed. All published papers will be free online to readers in perpetuity.