English
Related papers

Related papers: Bridge position and the representativity of spatia…

200 papers

In this article we study a partial ordering on knots in the 3-sphere where K_1 is greater than or equal to K_2 if there is an epimorphism from the knot group of K_1 onto the knot group of K_2 which preserves peripheral structure. If K_1 is…

Geometric Topology · Mathematics 2014-10-01 Jim Hoste , Patrick D. Shanahan

We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…

Geometric Topology · Mathematics 2011-08-16 Erica Flapan , Harry Tamvakis

In a lens space X of order r a knot K representing an element of the fundamental group pi_1 X = Z/rZ of order s <= r contains a connected orientable surface S properly embedded in its exterior X-N(K) such that the boundary of S intersects…

Geometric Topology · Mathematics 2009-04-30 Kenneth L Baker

Let $F$ be a non-Archimedean valued field, $\Sigma$ a closed Riemann surface of genus at least two, and $\Gamma$ its fundamental group. Building on the theory of equivariant harmonic maps into $\mathbb{R}$-trees, we study the…

Differential Geometry · Mathematics 2025-11-06 Jiahuang Chen , Siqi He

Let $G$ be a simple graph. The $k$-th neighborhood of a vertex subset $S \subseteq V(G)$, denoted $\Lambda^k(S)$, is the set of vertices that are adjacent to at least $k$ vertices in $S$. The $k$-th binding number $\beta^k(G)$ is defined as…

Combinatorics · Mathematics 2025-08-27 Guantao Chen , Mikhail Lavrov , Yuying Ma , Jennifer Vandenbussche , Hein van der Holst

For a graph $G = (V, E)$, the $\gamma$-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent if they differ by a single vertex and the two…

Combinatorics · Mathematics 2020-11-04 Christopher M. van Bommel

Let $T$ be a satellite knot, link, or spatial graph in a 3-manifold $M$ that is either $S^3$ or a lens space. Let $\mathfrak{b}_0$ and $\mathfrak{b}_1$ denote genus 0 and genus 1 bridge number, respectively. Suppose that $T$ has a companion…

Geometric Topology · Mathematics 2025-07-18 Scott A. Taylor , Maggy Tomova

The topological symmetry group $\mathrm{TSG}(\Gamma)$ of an embedding $\Gamma$ of a graph in $S^3$ is the subgroup of the automorphism group of the graph which is induced by homeomorphisms of $(S^3,\Gamma)$. If we restrict to orientation…

Geometric Topology · Mathematics 2026-01-21 A. Álvarez , E. Flapan , M. Hunnell , J. Hutchens , E. Lawrence , P. Lewis , C. Price , R. Vanderpool

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Group Theory · Mathematics 2020-03-04 B. Akbari , Mark L. Lewis , J. Mirzajani , A. R. Moghaddamfar

A $t$-bar visibility representation of a graph assigns each vertex up to $t$ horizontal bars in the plane so that two vertices are adjacent if and only if some bar for one vertex can see some bar for the other via an unobstructed vertical…

Combinatorics · Mathematics 2019-05-07 Weiting Cao , Douglas B. West , Yan Yang

Let $\triangleleft$ be a relation between graphs. We say a graph $G$ is \emph{$\triangleleft$-ubiquitous} if whenever $\Gamma$ is a graph with $nG \triangleleft \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \triangleleft…

Combinatorics · Mathematics 2018-06-12 Nathan Bowler , Christian Elbracht , Joshua Erde , Pascal Gollin , Karl Heuer , Max Pitz , Maximilian Teegen

A graph $G$ is said to be ubiquitous, if every graph $\Gamma$ that contains arbitrarily many disjoint $G$-minors automatically contains infinitely many disjoint $G$-minors. The well-known Ubiquity conjecture of Andreae says that every…

We seek to connect ideas in the theory of bridge trisections with other well-studied facets of classical knotted surface theory. First, we show how the normal Euler number can be computed from a tri-plane diagram, and we use this to give a…

Geometric Topology · Mathematics 2022-10-19 Jason Joseph , Jeffrey Meier , Maggie Miller , Alexander Zupan

A graph $G$ is said to be the intersection of graphs $G_1,G_2,\ldots,G_k$ if $V(G)=V(G_1)=V(G_2)=\cdots=V(G_k)$ and $E(G)=E(G_1)\cap E(G_2)\cap\cdots\cap E(G_k)$. For a graph $G$, $\mathrm{dim}_{COG}(G)$ (resp. $\mathrm{dim}_{TH}(G)$)…

Discrete Mathematics · Computer Science 2020-01-06 Daphna Chacko , Mathew C. Francis

We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (a cospectral mate), or at least one other graph with the same Smith normal form…

Combinatorics · Mathematics 2020-08-14 Aida Abiad , Carlos A. Alfaro

In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.

Geometric Topology · Mathematics 2016-02-24 Kazuhiko Inoue

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

Combinatorics · Mathematics 2016-11-23 Mark S. MacLean , Stefko Miklavic

The pinched sphere is the pseudo-surface $\mathbb{S}^{\circ}_0$ obtained by identifying two distinct points of the sphere. We provide a structural characterization of graphs excluding an $\mathbb{S}^{\circ}_0$-embeddable graph as a minor.…

Combinatorics · Mathematics 2025-06-18 Laure Morelle , Evangelos Protopapas , Dimitrios M. Thilikos , Sebastian Wiederrecht

Given a directed graph $G$ and a pair of nodes $s$ and $t$, an $s$-$t$ bridge of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$. Similarly, an $s$-$t$ articulation point of $G$ is a node whose removal breaks all $s$-$t$ paths…

Data Structures and Algorithms · Computer Science 2020-06-29 Massimo Cairo , Shahbaz Khan , Romeo Rizzi , Sebastian Schmidt , Alexandru I. Tomescu , Elia Zirondelli

The size-Ramsey number of a graph $F$ is the smallest number of edges in a graph $G$ with the Ramsey property for $F$, that is, with the property that any 2-colouring of the edges of $G$ contains a monochromatic copy of $F$. We prove that…

Combinatorics · Mathematics 2023-06-22 Dennis Clemens , Meysam Miralaei , Damian Reding , Mathias Schacht , Anusch Taraz
‹ Prev 1 8 9 10 Next ›