2 papers
math.CO2025
A Sharp Ramsey Theorem for Ordered Hypergraph Matchings
Lisa Sauermann, Dmitrii Zakharov
We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and RuciÅski. Namely, for any and ,…
math.CO2025
Essentially tight bounds for rainbow cycles in proper edge-colourings
Noga Alon, Matija BuciÄ, Lisa Sauermann +2
An edge-coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decad…