مسألة نهاية سعيدة (Arabic Wikipedia)

Analysis of information sources in references of the Wikipedia article "مسألة نهاية سعيدة" in Arabic language version.

refsWebsite

Global rank Arabic rank

1^st place

8,650^th place

low place

2^nd place

5^th place

low place

austms.org.au

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، ص. 151–164، DOI:10.1017/S144618110000300X، مؤرشف من الأصل في 2019-12-13.

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، ص. 151–164، DOI:10.1017/S144618110000300X، مؤرشف من الأصل في 2019-12-13.

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 Math، ج. 2، ص. 463–470، مؤرشف من الأصل في 2019-02-19. 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، Baton Rouge, La.: Louisiana State Univ.، ج. 1، ص. 180–188.

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 Math، ج. 2، ص. 463–470، مؤرشف من الأصل في 2019-02-19. 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، Baton Rouge, La.: Louisiana State Univ.، ج. 1، ص. 180–188.
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، ص. 151–164، DOI:10.1017/S144618110000300X، مؤرشف من الأصل في 2019-12-13.