On an Erdős-Szekeres Game
Discrete Mathematics & Theoretical Computer Science · 09.03.2026 · vol. 27:1, Permutation... (Special issues)
DOI: 10.46298/dmtcs.14855 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 09.03.2026. Verfasst von Lara Pudwell. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We consider a 2-player permutation game inspired by the celebrated Erdős-Szekeres Theorem. The game depends on two positive integer parameters $a$ and $b$ and we determine the winner and give a winning strategy when $a \geq b$ and $b \in \left\{2,3,4,5\right\}$. 18 pages
Zitieren
APA
Pudwell, L. (2026). On an Erdős-Szekeres Game. Discrete Mathematics & Theoretical Computer Science, vol. 27:1, Permutation...(Special issues). https://doi.org/10.46298/dmtcs.14855
Vancouver
Pudwell L. On an Erdős-Szekeres Game. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 27:1, Permutation...(Special issues). doi:10.46298/dmtcs.14855
BibTeX
@article{Pudwell2026,
author = {Pudwell, Lara},
title = {On an Erdős-Szekeres Game},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 27:1, Permutation...},
number = {Special issues},
doi = {10.46298/dmtcs.14855}
}
EUVIMED