Pierre Ohlmann

activity

20242026

collaborators

Showing cs.LOShow all

4 papers · 1 filter

cs.LO2026

Trees in graphs of large linear cliquewidth

MikoÅaj BojaÅczyk, Pierre Ohlmann

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precise…

cs.LO2026

The memory of $I ¨ $ -regular and BC( $I^£_{2}^{0}$ ) objectives

Antonio Casares, Pierre Ohlmann

In the context of 2-player zero-sum infinite-duration games played on (potentially infinite) graphs, the memory of an objective is the smallest integer k such that in any game won…

cs.LO2026

Positionality in $I^£_{0}^{2}$ and a completeness result

Pierre Ohlmann, MichaÅ Skrzypczak

We study the existence of positional strategies for the protagonist in infinite duration games over arbitrary game graphs. We prove that prefix-independent objectives in $I^£_{0}^{2}$ w…

cs.LO2025

Flipper games for monadically stable graph classes

Jakub GajarskÃ½, Nikolas MÃ¤hlmann, Rose McCarty +6

A class of graphs $C$ is monadically stable if for any unary expansion $C$ of $C$ , one cannot interpret, in first-order logic, arbitrarily l…

Trees in graphs of large linear cliquewidth

The memory of I¨-regular and BC(I^£20​) objectives

Positionality in I^£02​ and a completeness result

Flipper games for monadically stable graph classes

The memory of $I ¨ $ -regular and BC( $I^£_{2}^{0}$ ) objectives

Positionality in $I^£_{0}^{2}$ and a completeness result