Graham's number (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graham's number" in English language version.

refsWebsite

Global rank English rank

1^st place

low place

2^nd place

69^th place

59^th place

513^th place

537^th place

3,615^th place

6,420^th place

arxiv.org

Lipka, Eryk (2019). "Further improving of upper bound on a geometric Ramsey problem". arXiv:1905.05617 [math.CO].
Barkley, Jerome (2008). "Improved lower bound on an Euclidean Ramsey problem". arXiv:0811.1055 [math.CO].

Lavrov, Mikhail; Lee, Mitchell; Mackey, John (2014). "Improved upper and lower bounds on a geometric Ramsey problem". European Journal of Combinatorics. 42: 135–144. doi:10.1016/j.ejc.2014.06.003.
Exoo, Geoffrey (2003). "A Euclidean Ramsey Problem". Discrete & Computational Geometry. 29 (2): 223–227. doi:10.1007/s00454-002-0780-5. Exoo refers to the Graham & Rothschild upper bound N by the term "Graham's number". This is not the "Graham's number" G published by Martin Gardner.

"Graham's number records". Iteror.org. Archived from the original on 2013-10-19. Retrieved 2014-04-09.
Martin Gardner (1977). "In which joining sets of points leads into diverse (and diverting) paths". Scientific American (November). Archived from the original on 2013-10-19.