그레이엄 수 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "그레이엄 수" in Korean language version.

refsWebsite

Global rank Korean rank

2web.archive.org

1^st place

1^st place

low place

low place

2^nd place

3^rd place

69^th place

54^th place

513^th place

230^th place

arxiv.org (Global: 69^th place; Korean: 54^th place)

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].

doi.org (Global: 2^nd place; Korean: 3^rd place)

dx.doi.org

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.

iteror.org (Global: low place; Korean: low place)

“Graham's number records”. Iteror.org. 2013년 10월 19일에 원본 문서에서 보존된 문서. 2014년 4월 9일에 확인함.
Martin Gardner (1977). “In which joining sets of points leads into diverse (and diverting) paths”. 《Scientific American》 (November). 2013년 10월 19일에 원본 문서에서 보존된 문서.

web.archive.org (Global: 1^st place; Korean: 1^st place)

“Graham's number records”. Iteror.org. 2013년 10월 19일에 원본 문서에서 보존된 문서. 2014년 4월 9일에 확인함.
Martin Gardner (1977). “In which joining sets of points leads into diverse (and diverting) paths”. 《Scientific American》 (November). 2013년 10월 19일에 원본 문서에서 보존된 문서.

wolfram.com (Global: 513^th place; Korean: 230^th place)

mathworld.wolfram.com

“Graham's Number”.