Happy ending problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Happy ending problem" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

2arxiv.org

69^th place

59^th place

2semanticscholar.org

11^th place

8^th place

1smh.com.au

132^nd place

96^th place

1numdam.org

8,650^th place

7,668^th place

1ams.org

451^st place

277^th place

1jstor.org

26^th place

20^th place

ams.org

mathscinet.ams.org

Holmsen et al. (2020). Holmsen, Andreas F.; Mojarrad, Hossein Nassajian; Pach, János; Tardos, Gábor (2020), "Two extensions of the Erdős–Szekeres problem", Journal of the European Mathematical Society, 22 (12): 3981–3995, arXiv:1710.11415, doi:10.4171/jems/1000, MR 4176784

arxiv.org

Suk (2016). See binomial coefficient and big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion. Suk, Andrew (2016), "On the Erdős–Szekeres convex polygon problem", J. Amer. Math. Soc., 30 (4): 1047–1053, arXiv:1604.08657, doi:10.1090/jams/869, S2CID 15732134
Holmsen et al. (2020). Holmsen, Andreas F.; Mojarrad, Hossein Nassajian; Pach, János; Tardos, Gábor (2020), "Two extensions of the Erdős–Szekeres problem", Journal of the European Mathematical Society, 22 (12): 3981–3995, arXiv:1710.11415, doi:10.4171/jems/1000, MR 4176784

doi.org

This has been proved by Szekeres & Peters (2006). They carried out a computer search which eliminated all possible configurations of 17 points without convex hexagons while examining only a tiny fraction of all configurations. Szekeres, G.; Peters, L. (2006), "Computer solution to the 17-point Erdős-Szekeres problem", ANZIAM Journal, 48 (2): 151–164, doi:10.1017/S144618110000300X
Suk (2016). See binomial coefficient and big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion. Suk, Andrew (2016), "On the Erdős–Szekeres convex polygon problem", J. Amer. Math. Soc., 30 (4): 1047–1053, arXiv:1604.08657, doi:10.1090/jams/869, S2CID 15732134
Holmsen et al. (2020). Holmsen, Andreas F.; Mojarrad, Hossein Nassajian; Pach, János; Tardos, Gábor (2020), "Two extensions of the Erdős–Szekeres problem", Journal of the European Mathematical Society, 22 (12): 3981–3995, arXiv:1710.11415, doi:10.4171/jems/1000, MR 4176784
Horton (1983) Horton, J. D. (1983), "Sets with no empty convex 7-gons", Canadian Mathematical Bulletin, 26 (4): 482–484, doi:10.4153/CMB-1983-077-8, S2CID 120267029
Overmars (2003). Overmars, M. (2003), "Finding sets of points without empty convex 6-gons", Discrete and Computational Geometry, 29 (1): 153–158, doi:10.1007/s00454-002-2829-x
Scheinerman & Wilf (1994) Scheinerman, Edward R.; Wilf, Herbert S. (1994), "The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability", American Mathematical Monthly, 101 (10), Mathematical Association of America: 939–943, doi:10.2307/2975158, JSTOR 2975158

jstor.org

Scheinerman & Wilf (1994) Scheinerman, Edward R.; Wilf, Herbert S. (1994), "The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability", American Mathematical Monthly, 101 (10), Mathematical Association of America: 939–943, doi:10.2307/2975158, JSTOR 2975158

numdam.org

According to Erdős & Szekeres (1935), this was first proved by E. Makai; the first published proof appeared in Kalbfleisch, Kalbfleisch & Stanton (1970). Erdős, P.; Szekeres, G. (1935), "A combinatorial problem in geometry", Compositio Mathematica, 2: 463–470 Kalbfleisch, J.D.; Kalbfleisch, J.G.; Stanton, R.G. (1970), "A combinatorial problem on convex regions", Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 1, Baton Rouge, La.: Louisiana State Univ., pp. 180–188

semanticscholar.org

api.semanticscholar.org

Suk (2016). See binomial coefficient and big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion. Suk, Andrew (2016), "On the Erdős–Szekeres convex polygon problem", J. Amer. Math. Soc., 30 (4): 1047–1053, arXiv:1604.08657, doi:10.1090/jams/869, S2CID 15732134
Horton (1983) Horton, J. D. (1983), "Sets with no empty convex 7-gons", Canadian Mathematical Bulletin, 26 (4): 482–484, doi:10.4153/CMB-1983-077-8, S2CID 120267029

smh.com.au

A world of teaching and numbers - times two, Michael Cowling, The Sydney Morning Herald, 2005-11-07, cited 2014-09-04