Showing 2025Show all
3 papers · 1 filter
cs.GT2025
Infinite lexicographic products of positional objectives
Antonio Casares, Pierre Ohlmann, Michał Skrzypczak +1
This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, Theoret…
cs.LO2025
The memory of -regular and BC() 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.LO2025
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…