Institute of
Discrete Mathematics and Geometry

Discrete Mathematics Working Group (Arbeitsgemeinschaft Diskrete Mathematik, AGDM)

Info: The AGDM seminar is a joint seminar of the University of Vienna and TU Wien. In winter semesters, we meet on Tuesdays from 15:00 to 16:30 at the University of Vienna. In summer semesters, we meet on Tuesdays at TU Wien.

Since 2025, we use a mailing-list to advertise the seminar. You can register here.

Place: University of Vienna, Oskar-Morgenstern-Platz 1, BZ 02

Time:Tuesday, 15:00-16:30

Next talk

Date: Tuesday 20.10.2026
Title: Tower heights for color-avoiding Ramsey numbers of monotone paths
Speaker: Hyunwoo Lee
Abstract: Ramsey numbers of monotone paths in ordered hypergraphs form a natural higher-uniformity extension of the classical Erd\H{o}s--Szekeres theorems, and their tower height was determined by Moshkovitz and Shapira. A color-avoiding variant, initiated by Loh and further developed by Gowers and Long and by Mulrenin, Pohoata, and Zakharov, asks for monotone paths whose edges use only a bounded number of colors rather than a single color.
For integers $q>p$, let $A_k(n;q,p)$ be the least integer $N$ such that every $q$-coloring of the ordered complete $k$-uniform hypergraph on $\{1,\ldots,N\}$ contains a monotone path of length $n$ whose edges use at most $p$ colors. We prove that, for every fixed $p$ and all sufficiently large $q$, the exact tower height of $A_k(n;q,p)$ is $\lceil (k-1)/p\rceil$. Thus the number of colors allowed on the path affects the Ramsey number at the level of tower height: allowing $p$ colors lowers the height from $k-1$ in the monochromatic problem to $\lceil (k-1)/p\rceil$. This answers questions of Mulrenin, Pohoata, and Zakharov.
The upper bound follows from a simple block-compression argument. The main contribution is the matching lower bound, for which we develop a novel variant of the stepping-up method. A surprising feature of the proof is the appearance of the Morse--Hedlund theorem, a foundational result in symbolic dynamics and combinatorics on words. We establish and use a finite version of this theorem, which may be of independent interest.
This talk is based on a joint work with Jigang Choi and Tuan Tran.

Code of conduct

Maintaining a respectful environment is essential to fostering meaningful dialogue and intellectual growth. Participants are expected to refrain from any form of disrespectful or inappropriate behaviour, including offensive comments, harassment, or disruptive conduct. Questions and contributions should be constructive, relevant to the topic, and posed in a professional manner that encourages healthy academic exchange. Harassment of any kind—including verbal, moral or physical—will not be tolerated, and all attendees are urged to uphold these principles to ensure a safe and welcoming atmosphere for everyone.

Upcoming talks

20.10.2026Hyunwoo Lee (KAIST)
03.11.2026
10.11.2026Alexander Omelchenko (Constructor University Bremen)
24.11.2026Marcus Schönfelder (Uni Wien)
15.12.2026Hans Höngesberg (Uni Wien)
12.01.2027Francesca Zaffalon (Max-Planck Institute)
26.01.2027

Talks in the past years

Talks of years 2005 - 2026

Past talks of this year