English
Related papers

Related papers: Spatial Graphs with Local Knots

200 papers

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and,…

Geometric Topology · Mathematics 2017-08-14 Hyoungjun Kim , Hwa Jeong Lee , Minjung Lee , Thomas Mattman , Seungsang Oh

We consider the existence of simple closed geodesics or "geodesic knots" in finite volume orientable hyperbolic 3-manifolds. Previous results show that at least one geodesic knot always exists [Bull. London Math. Soc. 31(1) (1999) 81-86],…

Geometric Topology · Mathematics 2013-01-02 Sally M Kuhlmann

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…

Combinatorics · Mathematics 2022-05-02 Somnath Basu , Dhruv Bhasin , Siddhartha Lal , Siddhartha Patra

A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…

Computational Geometry · Computer Science 2007-08-08 Colm O Dunlaing

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

Geometric Topology · Mathematics 2007-05-23 Thomas W. Mattman , Ryan Ottman , Matt Rodrigues

For a given spatial graph $\mathcal{G} \subset \mathbb{R}^3$, we would like to find a closed orientable surface $\mathcal{S}$ embedded in $\mathbb{R}^3$ in which $\mathcal{G}$ is cellular embedded. However, for general $\mathcal{G}$ this is…

Geometric Topology · Mathematics 2025-10-21 Senja Barthel , Fabio Buccoliero

Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise…

Geometric Topology · Mathematics 2016-03-29 J. Li , T. J. Peters , K. E. Jordan , P. Zaffetti

We give an alternative proof of that a critical knot of a Morse-Bott function $f: S^3 \rightarrow \mathbb{R}$ is a graph knot where the critical set of $f$ is a link in $S^3$. Our proof inducts on the number of index-1 critical knots of…

General Topology · Mathematics 2017-08-24 Metin Ozsarfati

We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…

Combinatorics · Mathematics 2017-03-28 Robin Thomas , Peter Whalen

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…

Geometric Topology · Mathematics 2014-10-01 Thomas Fleming , Blake Mellor

Following the analogies between 3-dimensional topology and number theory, we study an id\`elic form of class field theory for 3-manifolds. For a certain set $\mathcal{K}$ of knots in a 3-manifold $M$, we first present a local theory for…

Geometric Topology · Mathematics 2013-12-12 Hirofumi Niibo

We give a short proof of Bing's characterization of $S^3$: a compact, connected 3-manifold $M$ is $S^3$ if and only if every knot in $M$ is isotopic into a ball.

Geometric Topology · Mathematics 2007-05-23 Yo'av Rieck

We show that if two tensor algebras of topological graphs are algebraically isomorphic, then the graphs are locally conjugate. Conversely, if the base space is at most one dimensional and the edge space is compact, then locally conjugate…

Operator Algebras · Mathematics 2010-04-06 Kenneth R. Davidson , Jean Roydor

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael, and, independently, Mattman showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim,…

Geometric Topology · Mathematics 2017-08-15 Hyoungjun Kim , Thomas Mattman , Seungsang Oh

The Kinoshita graph is a particular embedding in the 3-sphere of a graph with three edges, two vertices and no loops. It has the remarkable property that although the removal of any edge results in an unknotted loop, the Kinoshita graph is…

Geometric Topology · Mathematics 2018-10-19 Makoto Ozawa , Scott A. Taylor

In this paper, it is proved that every topological gyrogroup $G$ is topologically groupoid isomorphic to a closed subgyrogroup of a connected, locally connected topological gyrogroup $G^{\bullet}$.

General Topology · Mathematics 2021-11-16 Jingling Lin , Meng Bao , Fucai Lin

The unknot U in S^4 has non-unique smooth spanning 3-balls up to isotopy fixing U. Equivalently there are properly embedded non-separating 3-balls in S^1xB^3 not properly isotopic to 1xB^3. More generally there exist non-separating…

Geometric Topology · Mathematics 2021-04-28 Ryan Budney , David Gabai

A knot in $S^3$ is topologically slice if it bounds a locally flat disk in $B^4$. A knot in $S^3$ is rationally slice if it bounds a smooth disk in a rational homology ball. We prove that the smooth concordance group of topologically and…

Geometric Topology · Mathematics 2023-04-14 Jennifer Hom , Sungkyung Kang , JungHwan Park

In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove…

Geometric Topology · Mathematics 2018-02-12 Gareth Wilkes

We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…

Discrete Mathematics · Computer Science 2020-10-20 David Eppstein
‹ Prev 1 3 4 5 6 7 10 Next ›