Search arXivSearch

arXiv · 2505.06472

The Trunk of the Restricted Flip Graph of Triangulated S^3

Abstract

Let (\mathcal{F}_M(n)) be the restricted flip graph of (n)-vertex triangulations of a closed connected (3)-manifold (M), whose edges are vertex-preserving (2)--(3) and (3)--(2) bistellar flips. Unlike the full Pachner graph, which also allows the vertex-changing (1)--(4) and (4)--(1) moves, the restricted flip graph may have multiple connected components. We prove a general Component Preservation Theorem: for any such (M), (1)--(4) stellar subdivision induces a well-defined map from the connected components of (\mathcal{F}_M(n)) to those of (\mathcal{F}_M(n+1)). For (S^3), we define the trunk to be the set of triangulations reachable from (\partialΔ^4) using (1)--(4), (2)--(3), and (3)--(2) moves, but no (4)--(1) moves. For every (n\ge 5), we prove that the level-(n) slice of the trunk is exactly one connected component of (\mathcal F(n)), and that the trunk is closed upward under (1)--(4) moves. Thus any Pachner path that starts in the trunk and leaves it must do so via a (4)--(1) move. We complement these structural results with computations for (S^3). We prove that every (10)- and (11)-vertex triangulation lies in the trunk, and hence that (\mathcal F(10)) and (\mathcal F(11)) are connected. We also prove that all (12)-vertex seed triangulations with minimum edge valence at least (4) lie in the trunk. Finally, we give explicit certificates showing that the four known isolated ``unflippable'' spheres---(U(16)), (U(20)), (U_1(21)), and (U_2(21))---all enter the trunk after a single (1)--(4) subdivision.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. Faber, M. Murphy. 2026-08-29. The Trunk of the Restricted Flip Graph of Triangulated S^3. https://arxiv.org/abs/2505.06472

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO