7 citations · 8 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2022★ 1 cited
Transducing paths in graph classes with unbounded shrubdepth
Michał Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz
Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic. We prove that a graph class ca…
math.CO2020
Regular partitions of gentle graphs
Yiting Jiang, Jaroslav Nesetril, Patrice Ossona de Mendez +1
Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classe…