Turán graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Turán graph" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

741^st place

577^th place

1,538^th place

1,042^nd place

102^nd place

76^th place

26^th place

20^th place

doi.org

Keevash & Sudakov (2003). Keevash, Peter; Sudakov, Benny (2003). "Local density in graphs with forbidden subgraphs" (PDF). Combinatorics, Probability and Computing. 12 (2): 139–153. doi:10.1017/S0963548302005539. S2CID 17854032.
Moon & Moser (1965). Moon, J. W.; Moser, L. (1965). "On cliques in graphs". Israel Journal of Mathematics. 3: 23–28. doi:10.1007/BF02760024. S2CID 9855414.
Pór & Wood (2005). Pór, Attila; Wood, David R. (2005). "No-three-in-line-in-3D". Proc. Int. Symp. Graph Drawing (GD 2004). Lecture Notes in Computer Science no. 3383, Springer-Verlag. pp. 395–402. doi:10.1007/b105810. hdl:11693/27422.
Witsenhausen (1974). Witsenhausen, H. S. (1974). "On the maximum of the sum of squared distances under a diameter constraint". American Mathematical Monthly. 81 (10): 1100–1101. doi:10.2307/2319046. JSTOR 2319046.

handle.net

hdl.handle.net

Pór & Wood (2005). Pór, Attila; Wood, David R. (2005). "No-three-in-line-in-3D". Proc. Int. Symp. Graph Drawing (GD 2004). Lecture Notes in Computer Science no. 3383, Springer-Verlag. pp. 395–402. doi:10.1007/b105810. hdl:11693/27422.

jstor.org

Witsenhausen (1974). Witsenhausen, H. S. (1974). "On the maximum of the sum of squared distances under a diameter constraint". American Mathematical Monthly. 81 (10): 1100–1101. doi:10.2307/2319046. JSTOR 2319046.

princeton.edu

math.princeton.edu

Keevash & Sudakov (2003). Keevash, Peter; Sudakov, Benny (2003). "Local density in graphs with forbidden subgraphs" (PDF). Combinatorics, Probability and Computing. 12 (2): 139–153. doi:10.1017/S0963548302005539. S2CID 17854032.

semanticscholar.org

api.semanticscholar.org

Keevash & Sudakov (2003). Keevash, Peter; Sudakov, Benny (2003). "Local density in graphs with forbidden subgraphs" (PDF). Combinatorics, Probability and Computing. 12 (2): 139–153. doi:10.1017/S0963548302005539. S2CID 17854032.
Moon & Moser (1965). Moon, J. W.; Moser, L. (1965). "On cliques in graphs". Israel Journal of Mathematics. 3: 23–28. doi:10.1007/BF02760024. S2CID 9855414.

unc.edu

cs.unc.edu

Falls, Powell & Snoeyink (2003). Falls, Craig; Powell, Bradford; Snoeyink, Jack (2003). "Computing high-stringency COGs using Turán type graphs" (PDF).