Search arXivSearch

arXiv · 2410.04450

Triangulated spheres with holes in triangulated surfaces

Abstract

Let $\mathbb{S}_h$ denote a sphere with $h$ holes. Given a triangulation $G$ of a surface $\mathbb{M}$, we consider the question of when $G$ contains a spanning subgraph $H$ such that $H$ is a triangulated $\mathbb{S}_h$. We give a new short proof of a theorem of Nevo and Tarabykin that every triangulation $G$ of the torus contains a spanning subgraph which is a triangulated cylinder. For arbitrary surfaces, we prove that every high facewidth triangulation of a surface with $h$ handles contains a spanning subgraph which is a triangulated $\mathbb{S}_{2h}$. We also prove that for every $0 \leq g' < g$ and $w \in \mathbb{N}$, there exists a triangulation of facewidth at least $w$ of a surface of Euler genus $g$ that does not have a spanning subgraph which is a triangulated $\mathbb{S}_{g'}$. Our results are motivated by, and have applications for, rigidity questions in the plane.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Katie Clinch, Sean Dewar, Niloufar Fuladi, Maximilian Gorsky, Tony Huynh, Eleftherios Kastis, Atsuhiro Nakamoto, Anthony Nixon, Brigitte Servatius. 2025-10-29. Triangulated spheres with holes in triangulated surfaces. https://arxiv.org/abs/2410.04450

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO