Related papers: On the width of complicated JSJ decompositions

In this paper, we show that every $O(m)$-edge-connected simple graph $G$ of size divisible by $m$ with minimum degree at least $2^{O(m)}$ has an edge-decomposition into isomorphic copies of any given tree $T$ of size $m$. Moreover, the…

We prove that any compact, orientable 3-manifold with empty or toral boundary is profinitely almost rigid among all compact, orientable 3-manifolds. In other words, the profinite completion of its fundamental group determines its…

A \emph{queue layout} of a graph consists of a total order of the vertices, and a partition of the edges into \emph{queues}, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is…

Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in…

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…

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…

Barnette and Edelson have shown that there are finitely many minimal triangulations of a connected compact 2-manifold M. Similar finiteness results are obtained for cellular partial triangulations that satisfy various girth inequality…

Dumas, Foucaud, Perez and Todinca (2024) recently proved that every graph whose edges can be covered by $k$ shortest paths has pathwidth at most $O(3^k)$. In this paper, we improve this upper bound on the pathwidth to a polynomial one;…

A Heegaard diagram for a 3-manifold is regarded as a pair of simplexes in the complex of curves on a surface and a Heegaard splitting as a pair of subcomplexes generated by the equivalent diagrams. We relate geometric and combinatorial…

In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one". They…

This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this question in graphs of bounded maximum degree, asserting that…

For a closed orientable connected 3-manifold $M$, its complexity $\boldsymbol{T}(M)$ is defined to be the minimal number of tetrahedra in its triangulations. Under the assumption that $M$ is prime (but not necessarily atoroidal), we…

Even the most superficial glance at the vast majority of crossing-minimal geometric drawings of $K_n$ reveals two hard-to-miss features. First, all such drawings appear to be 3-fold symmetric (or simply {\em 3-symmetric}) . And second, they…

We address a conjecture that $\pi_1$-surjective maps between closed aspherical 3-manifolds having the same rank on $\pi_1$ must be of non-zero degree. The conjecture is proved for Seifert manifolds, which is used in constructing the first…

A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…

A \emph{$t$-treewidth-modulator} of a graph $G$ is a set $X \subseteq V(G)$ such that the treewidth of $G-X$ is at most some constant $t-1$. In this paper, we present a novel algorithm to compute a decomposition scheme for graphs $G$ that…

This paper is a survey of some of the most elementary consequences of the JSJ-decomposition and geometrization for knot and link complements in the 3-sphere. Formulated in the language of graphs, the result is the construction of a…

As a major step in their proof of Wagner's conjecture, Robertson and Seymour showed that every graph not containing a fixed graph $H$ as a minor has a tree-decomposition in which each torso is almost embeddable in a surface of bounded…

Treedepth, a more restrictive graph width parameter than treewidth and pathwidth, plays a major role in the theory of sparse graph classes. We show that there exists a constant $C$ such that for every positive integers $a,b$ and a graph…

We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We…