Preprint · 2026 · Open access
Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research
Zenodo (CERN European Organization for Nuclear Research) · Published 20 July 2026 · DOI 10.5281/zenodo.21449759
In brief
“Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research” is a 2026 preprint by Andrew Stewart Caldin, published in Zenodo (CERN European Organization for Nuclear Research). OpenAlex counts 0 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at Zenodo (CERN European Organization for Nuclear Research).
- Citations
- 0
- Authors
- 1
Abstract
FINDING: Probabilistic method yields exponential lower bound for Ramsey numbers \( R(k,k) > 2^{k/2} \) via random graph coloring, with recent improvements to the upper bound by Campos–Griffiths–Morris–Sahasrabudhe (CGMS) optimizing the classic Erdős–Szekeres bound. | MATH: Lower bound: \( R(k,k) > 2^{k/2} \) (Erdős, 1947). Upper bound (CGMS, 2024): \( R(k,k) \leq (4 - \epsilon)^k \) for some \(\epsilon > 0\), improving on \( R(k,k) \leq 4^k / \sqrt{k} \). Key constant: \( \epsilon \approx 0.04 \) from lattice-based optimization. | CONNECTION: The lower bound construction uses random graphs, which are inherently symmetric under the full symmetric group \( S_n \). The CGMS upper bound employs a lattice structure in the space of red-blue edge colorings, reminiscent of root lattice \( A_n \) geometry and the golden ratio's appearance in extremal graph density thresholds (e.g., Turán density \( 1 - 1/(t-1) \) for \( K_t \)-free graphs). The constant \( 4 \) in the upper bound relates to the Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Caldin, A. S. (2026). Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.21449759
MLA 9
Caldin, Andrew Stewart. “Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research.” Zenodo (CERN European Organization for Nuclear Research), 2026. https://doi.org/10.5281/zenodo.21449759.
Chicago
Caldin, Andrew Stewart. 2026. “Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research.” Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.21449759.
Harvard
Caldin, A. S. (2026) ‘Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research’, Zenodo (CERN European Organization for Nuclear Research). doi:10.5281/zenodo.21449759.
IEEE
A. S. Caldin, “Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research,” Zenodo (CERN European Organization for Nuclear Research), 2026, doi: 10.5281/zenodo.21449759.
BibTeX
@misc{caldin2026probabilistic,
title = {{Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research}},
author = {Caldin, Andrew Stewart},
howpublished = {Zenodo (CERN European Organization for Nuclear Research)},
year = {2026},
doi = {10.5281/zenodo.21449759},
url = {https://doi.org/10.5281/zenodo.21449759}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Ramsey numbers
- lattice optimization
- Turán density
- extremal graph theory
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Caldin, A. S. (2026). Probabilistic Lower Bound and Recent Upper Bound Improvement for Ramsey Numbers — E8 Intelligence Research. Zenodo (CERN European Organization for Nuclear Research). https://doi.org/10.5281/zenodo.21449759
How many times has this paper been cited?
0 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Zenodo (CERN European Organization for Nuclear Research): sign in and open the full text from this page.
Who wrote this paper?
Andrew Stewart Caldin.
What is the DOI of this paper?
10.5281/zenodo.21449759, permanently at https://doi.org/10.5281/zenodo.21449759. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.