16 citations · 188 across the 122 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
Strong immersion is a well-quasi-ordering for semi-complete digraphs
Florian Barbero, Christophe Paul, Michal Pilipczuk
We prove that the strong immersion order is a well-quasi-ordering on the class of semi-complete digraphs, thereby strengthening a result of Chudnovsky and Seymour that this holds f…
cs.DM2017★ 2 cited
On the number of types in sparse graphs
Michał Pilipczuk, Sebastian Siebertz, Szymon Toruńczyk
We prove that for every class of graphs which is nowhere dense, as defined by Nesetril and Ossona de Mendez, and for every first order formula , whe…