3 papers
math.CO2025
Even cycles in graphs avoiding longer even cycles
David Conlon, Eion Mulrenin, Cosmin Pohoata
A conjecture of Verstraëte states that for any fixed there exists a positive constant such that any -free graph contains a -free subgraph with…
math.CO2024
Sharp exponents for bipartite Erdős-Rado numbers
Dániel Dobák, Eion Mulrenin
The Erdős-Rado canonization theorem generalizes Ramsey's theorem to edge-colorings with an unbounded number of colors, in the sense that for sufficiently large, any edg…
math.CO2024
Color avoidance for monotone paths
Eion Mulrenin, Cosmin Pohoata, Dmitrii Zakharov
In 2014, Moshkovitz and Shapira determined the tower height for hypergraph Ramsey numbers of tight monotone paths. We address the color-avoiding version of this problem in which on…