MDMarc Distel

Marc Distel

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Marc Distel has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A coarse Gallai theorem

    by Marc Distel, Ugo Giocanti, JęDrzej Hodor, Clément Legrand-Duchesne, Piotr Micek

    We prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$, for every graph $G$ and every subset $A$ of the vertices of $G$, either $G$ contains $k$ $A$-paths such that vertices of different $A$-paths are at distance at least $d$ in $G$, or there exists a set $X$ of the vertices of $G$ with $|X|\leq f(k)$ such that every $A$-path in $G$ contains a vertex of $B_G(X,g(k,d))$.

  • Open Access

    An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth

    by 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 characterisation of graphs quasi-isometric to graphs of treewidth $k$. In this paper, we give a new characterisation of such graphs. Specifically, we show that such graphs $G$ are characterised by the existence of a partition whose quotient has treewidth at most $k$ and such that each part has bounded weak diameter in $G$. The primary contribution of our characterisation is a structural description of graphs that admit such a quasi-isometry. This differs from the characterisation mentioned above, which primarily shows the existence of such a quasi-isometry. The characterisations are complementary, and neither immediately implies the other.

  • Open Access

    Treewidth, Hadwiger Number, and Induced Minors

    by Rutger Campbell, James Davies, Marc Distel, Bryce Frederickson, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Sebastian Wiederrecht, David R. Wood, Liana Yepremyan

    Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say that a graph class $\mathcal{G}$ is (tw,had)-bounded if there is a function $f$ (called the (tw,had)-bounding function) such that tw$(G)$ $\leq$ $f$(had$(G)$) for every graph $G \in \mathcal{G}$. We characterise (tw,had)-bounded graph classes as those that exclude some planar graph as an induced minor, and use this characterisation to show that every proper vertex-minor-closed class is (tw,had)-bounded. Furthermore, we demonstrate that any (tw,had)-bounded graph class has a (tw,had)-bounding function in O(had$(G)^9$polylog(had$(G)$)). Our bound comes from the bound for the Grid Minor Theorem given by Chuzhoy and Tan, and any quantitative improvement to their result will lead directly to an improvement to our result. More strongly, we conjecture that every (tw,had)-bounded graph class has a linear (tw,had)-bounding function. In support of this conjecture, we show that it holds for the class of outer-string graphs, and for a natural generalisation of outer-string graphs: intersection graphs of strings rooted at the boundary of a fixed surface. We also verify our conjecture for low-rank perturbations of circle graphs, which is an important step towards verifying it for all proper vertex-minor-closed classes.

  • Product Structure of Graph Classes with Bounded Treewidth

    by Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, et al.

  • Open Access

    Product structure extension of the Alon--Seymour--Thomas theorem

    by Marc Distel, Vida Dujmović, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michał T. Seweryn, David R. Wood

    Alon, Seymour and Thomas [1990] proved that every $n$-vertex graph excluding $K_t$ as a minor has treewidth less than $t^{3/2}\sqrt{n}$. Illingworth, Scott and Wood [2022] recently refined this result by showing that every such graph is a subgraph of some graph with treewidth $t-2$, where each vertex is blown up by a complete graph of order $O(\sqrt{tn})$. Solving an open problem of Illingworth, Scott and Wood [2022], we prove that the treewidth bound can be reduced to $4$ while keeping blowups of order $O_t(\sqrt{n})$. As an extension of the Lipton--Tarjan theorem, in the case of planar graphs, we show that the treewidth can be further reduced to $2$, which is best possible. We generalise this result for $K_{3,t}$-minor-free graphs, with blowups of order $O(t\sqrt{n})$. This setting includes graphs embeddable on any fixed surface.