13 citations · 26 across the 17 of their papers we have counts for
4 papers · 1 filter
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…
Excluding as a fat minor
Sandra Albrechtsen, Marc Distel, Agelos Georgakopoulos
We prove that for every , the graph satisfies the fat minor conjecture of Georgakopoulos and Papasoglu: for every there exist $M,A\in…
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…
An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
Marc Distel
Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graph…