3 papers
cs.DM2026
Characterizations of monadically dependent tree-ordered weakly sparse structures
Hector Buffière, Yuquan Lin, Jaroslav Nešetřil +2
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered -structu…
math.CO2025
Blind cop-width and balanced minors of graphs
Hector Buffière, Rutger Campbell, Kevin Hendrey +1
We investigate a pursuit-evasion game on an undirected graph in which a robber, moving at a fixed constant speed, attempts to evade a team of cops who are blind to the robber's loc…
math.CO2025
Decomposing graphs into stable and ordered parts
Hector Buffière, Patrice Ossona de Mendez
Connections between structural graph theory and finite model theory recently gained a lot of attention. In this setting, many interesting questions remain on the properties of depe…