Gaussian random graphs and Ramsey numbers
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910230937337856 |
|---|---|
| author | Hunter, Zach Milojević, Aleksa Sudakov, Benny |
| author_facet | Hunter, Zach Milojević, Aleksa Sudakov, Benny |
| contents | We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction based on Gaussian random graphs, which allows us to simplify their analysis significantly. As a consequence of this simpler analysis, we also obtain better quantitative bounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_17718 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Gaussian random graphs and Ramsey numbers Hunter, Zach Milojević, Aleksa Sudakov, Benny Combinatorics 05D10, 05C80 We give a simple proof of the recent remarkable exponential improvement for Ramsey lower bounds, obtained by Ma, Shen and Xie. Our key ingredient is an alternative construction based on Gaussian random graphs, which allows us to simplify their analysis significantly. As a consequence of this simpler analysis, we also obtain better quantitative bounds. |
| title | Gaussian random graphs and Ramsey numbers |
| topic | Combinatorics 05D10, 05C80 |
| url | https://arxiv.org/abs/2512.17718 |