Ole Gabsdil

collaborators

2 papers

math.CO2026

Supersaturation of induced even cycles in locally sparse graphs

Adam Džavoronok, Ole Gabsdil, Alexander Mylet +2

A graph $Γ$ is $(c, t)$ -sparse for $c > 0$ and $t \geq 1$ if for every pair of vertex subsets $A, B \subseteq V (Γ)$ with $∣ A ∣, ∣ B ∣ \geq t$ , the number of edges $e (A, B)$ between them s…

cs.DC2025

On the Universality of Round Elimination Fixed Points

Alkida Balliu, Sebastian Brandt, Ole Gabsdil +2

Recent work on distributed graph algorithms [e.g. STOC 2022, ITCS 2022, PODC 2020] has drawn attention to the following open question: are round elimination fixed points a universa…