no code implementations • 13 Apr 2020 • Gábor Damásdi, Balázs Keszegh, David Malec, Casey Tompkins, Zhiyu Wang, Oscar Zamora
We prove a saturation version of the Erd\H{o}s-Szekeres theorem about monotone subsequences and saturation versions of some Ramsey-type theorems on graphs and Dilworth-type theorems on posets.
Combinatorics
