References
- Frank P. Ramsey (1930). On a problem of formal logic. Proceedings of the London Mathematical Society, 30, 264–286.
- Geoffrey Exoo (1989). A lower bound for r (5, 5). Journal of Graph Theory, 13, 97–98.
- Vigleik Angeltveit and Brendan D. McKay (2024). r(5, 5) ≤ 46 (2024). arXiv:2409.15709.
- Vigleik Angeltveit and Brendan D. McKay (2018). r (5, 5) ≤ 48. Journal of Graph Theory, 89, 5–13.
- Ronald L. Graham and Joel H. Spencer (1990). Ramsey theory. Scientific American, 263, 112–117.
- Richard W. Hamming (1950). Error detecting and error correcting codes. The Bell System Technical Journal, 29, 147–160.
- Noga Alon and Joel H. Spencer (2008). The probabilistic method. Wiley-Interscience. Hoboken, NJ,. 3 edition.
- Ronald L. Graham, Bruce L. Rothschild and Joel H. Spencer (1990). Ramsey theory. Wiley-Interscience. NewYork, 2 edition.
- Andrew M. Childs, Eddie Schoute and Cem M. Unsal (2019). Circuit transformations for quantum architectures. In 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019). Volume 135 of Leibniz International Proceedings in Informatics (LIPIcs), pages 3:1–3:24. Schloss Dagstuhl–Leibniz-Zentrum für Informatik. arXiv:1902.09102.
- Fabrizio Tamburini, Nicolò Leone, Marco Sanna and Roberto Siagri (2025). Graded paraparticle algebra of majorana fields for multidimensional quantum computing with structured light. arXiv:2505.23232.
- Stanisław P. Radziszowski (2021). Small ramsey numbers. Electronic Journal of Combinatorics, DS1.
- Jan Goedgebeur and Steven Van Overberghe (2021). New bounds for ramsey numbers r(kk – e, kℓ – e). arXiv:2107.04460.
- Hefeng Wang (2016). Determining ramsey numbers on a quantum computer. Physical Review A, 93, 032301.
- Frank Gaitan and Lane Clark (2012). Ramsey numbers and adiabatic quantum computing. Physical Review Letters, 108,010501.
- Paul Erdős (1947). Some remarks on the theory of graphs. Bulletin of the American Mathematical Society, 53, 292–294.
- Brendan D. McKay and Stanisław P. Radziszowski (1995). r (4, 5) = 25. Journal of Graph Theory, 19, 309–322.
- H. S. Green (1953). A generalized method of field quantization. Physical Review, 90, 270–273.
- A. Yu. Kitaev (2001). Unpaired majorana fermions in quantum wires. Physics-Uspekhi, 44, s131–s136.
- P. Erdős and L. Lovász (1975). Problems and results on 3-chromatic hypergraphs and some related questions. In A. Hajnal, R. Rado, and V. T. Sós, editors, Infinite and Finite Sets. Volume 10 of Colloquia Mathematica Societatis János Bolyai, pages 609–627. North-Holland, Amsterdam.
- Svante Janson, Tomasz Łuczak and Andrzej Rucinski (2000). Random graphs. Wiley Series in Discrete Mathematics and Optimization. Wiley-Interscience. New York. url: https://onlinelibrary.wiley.com/doi/book/10.1002/9781118032718.
- Svante Janson (1990). Poisson approximation for large deviations. Random Structures & Algorithms, 1, 221–229.
- Neil J. Calkin, Paul Erdős and Craig A. Tovey (1997). New ramsey bounds from cyclic graphs of prime order. SIAM Journal on Discrete Mathematics, 10, 381–387.
- Rudolf Mathon (1987). Lower bounds for ramsey numbers and association schemes. Journal of Combinatorial Theory, Series B, 42, 122–127.
- Xiaodong Xu and Stanisław P. Radziszowski (2009). An improvement to mathon’s cyclotomic ramsey colorings. Electronic Journal of Combinatorics 16, N1.
- R. E. A. C. Paley (1933). On orthogonal matrices. Journal of Mathematics and Physics, 12, 311–320.
- V. I. Oseledets (1968). A multiplicative ergodic theorem: Characteristic lyapunov exponents of dynamical systems. Trudy Moskovskogo Matematicheskogo Obshchestva, 19, 179–210.
- Dermot McCarthy and Chris Monico (2025). A mathon-type construction for digraphs and improved lower bounds for ramsey numbers. Electronic Journal of Combinatorics, 32, P2.42.
- Geoffrey Exoo. “Paley graph data: Clique/chromatic numbers and ramsey bounds”. https://cs.indstate.edu/ge/Paley/index.html. Accessed Aug. 2025. Includes the Paley(797) witness used for R(10, 10) ≥ 798.
- OEIS Foundation Inc (2025). The on-line encyclopedia of integer sequences, sequence a212954. https://oeis.org/A212954. accessed 2025-08-19.
- David Cariolaro, Gianfranco Cariolaro, Uwe Schauz and Xiaogang Sun (2014). The list-chromatic index of k6. Discrete Mathematics, 322, 15–18.
- David Cariolaro (2007). On the ramsey number r (3, 6). Australasian Journal of Combinatorics, 37, 301–304.
- Ian T. Jolliffe and Jorge Cadima (2016). Principal component analysis: A review and recent developments. Philosophical Transactions of the Royal Society A, 374, 20150202.
- Sanjoy Dasgupta and Anupam Gupta (1999). An elementary proof of the johnson–lindenstrauss lemma. Technical Report TR-99-006. International Computer Science InstituteBerkeley, CA.