5 citations · 5 across the 5 of their papers we have counts for
5 papers
A coarse Gallai theorem
Marc Distel, Ugo Giocanti, Jędrzej Hodor +2
We prove that there exist functions and such that for all positive integers and , for every graph and every subset of the vertices of , either contain…
Small counterexamples to the fat minor conjecture
Sandra Albrechtsen, Marc Distel, Agelos Georgakopoulos
We narrow the gap between the family of graphs that do and the family of graphs that do not satisfy the fat minor conjecture by obtaining much simpler counterexamples than were pre…
An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
Marc Distel
Quasi-isometry is a measure of how similar two graphs are at `large-scale'. Nguyen, Scott, and Seymour [arXiv:2501.09839] and Hickingbotham [arXiv:2501.10840] independently gave a…
Graphs Excluding a Minor in Blowups of Treewidth 3 Graphs
Marc Distel
Alon, Seymour, and Thomas [J. Amer. Math. Soc. 1990] famously showed that every -vertex -minor-free graph has treewidth . Recently, Distel, Dujmović, Eppstei…
Product structure of graph classes with bounded treewidth
Rutger Campbell, Katie Clinch, Marc Distel +8
We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph. To this end…