English
Related papers

Related papers: Every graph has an embedding in $S^3$ containing n…

200 papers

Given a compact orientable 3-manifold M whose boundary is a hyperbolic surface and a simple closed curve C in its boundary, every knot in M is homotopic to one whose complement admits a complete hyperbolic structure with totally geodesic…

Geometric Topology · Mathematics 2007-05-23 Richard P. Kent

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this…

Combinatorics · Mathematics 2013-05-10 Julia Böttcher , Anusch Taraz , Andreas Würfl

Suppose that a hyperbolic knot in $S^3$ admits a finite surgery, Boyer and Zhang proved that the surgery slope must be either integral or half-integral, and they conjectured that the latter case does not happen. Using the correction terms…

Geometric Topology · Mathematics 2013-10-07 Eileen Li , Yi Ni

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

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…

Geometric Topology · Mathematics 2026-03-10 E. Alkin , A. Miroshnikov , A. Skopenkov

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…

Geometric Topology · Mathematics 2018-07-25 Marion Campisi , Matt Rathbun

The path eccentricity of a connected graph $G$ is the minimum integer $k$ such that $G$ has a path such that every vertex is at distance at most $k$ from the path. A result of Duffus, Jacobson, and Gould from 1981 states that every…

Combinatorics · Mathematics 2025-08-21 Sylwia Cichacz , Claire Hilaire , Tomáš Masařík , Jana Masaříková , Martin Milanič

A graph $G$ is $\{F_{1}, F_{2},\dots,F_{k}\}$-free if $G$ contains no induced subgraph isomorphic to any $F_{i}$ $(1\leq i \leq k)$. A connected graph $G$ is a split graph if its vertex set can be partitioned into a clique and an…

Combinatorics · Mathematics 2026-03-16 Tao Tian , Fengming Dong

We construct a simply connected $2-$complex $C$ embeddable in $3-$space such that for any embedding of $C$ in $\mathbb S^3$, any edge contraction forms a minor of the $2-$complex not embeddable in $3-$space. We achieve this by proving that…

Combinatorics · Mathematics 2020-03-03 Johannes Carmesin , Lyuben Lichev

A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. There is an obvious necessary degree condition for the immersion containment: if $G$…

Combinatorics · Mathematics 2022-09-27 Chun-Hung Liu

We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The…

Quantum Physics · Physics 2023-05-08 Eric Samperton

We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six…

Geometric Topology · Mathematics 2008-11-04 Sophy Huck , Alexandra Appel , Miguel-Angel Manrique , Thomas W Mattman

We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…

Geometric Topology · Mathematics 2023-12-13 Benjamin Barrett , David Hume , Larry Guth , Elia Portnoy

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

Combinatorics · Mathematics 2023-06-21 Richard Lang , Nicolás Sanhueza-Matamala

We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rz\k{a}\.zewski, Thomass\'e, and Walczak, that for every graph $H$, there is a polynomial $p$ such that for every positive integer $s$, every graph of average degree at least $p(s)$…

Combinatorics · Mathematics 2024-09-30 Romain Bourneuf , Matija Bucić , Linda Cook , James Davies

This paper focuses on the graphs in the Petersen family, the set of minor minimal intrinsically linked graphs. We prove there is a relationship between algebraic linking of an embedding and knotting in an embedding. We also present a more…

Geometric Topology · Mathematics 2010-08-03 Danielle O'Donnol

Given a graph $H$, a graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. For a positive real number $t$, a non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the…

Combinatorics · Mathematics 2023-03-21 Leyou Xu , Chengli Li , Bo Zhou

Consider a continuous flow in $\mathbb{R}^3$ or any orientable $3$-manifold. Let $(Q_1, Q_0)$ be an index pair in the sense of Conley and consider the region $N := \overline{Q_1 - Q_0}$. (An example of this is a compact $3$-manifold $N$…

Dynamical Systems · Mathematics 2024-03-28 J. J. Sánchez-Gabites

If $X$ is a geodesic metric space and $x_1,x_2,x_3\in X$, a geodesic triangle $T=\{x_1,x_2,x_3\}$ is the union of the three geodesics $[x_1x_2]$, $[x_2x_3]$ and $[x_3x_1]$ in $X$. The space $X$ is $\delta$-hyperbolic (in the Gromov sense)…

Metric Geometry · Mathematics 2020-01-23 Walter Carballosa , José M. Rodríguez , Omar Rosario , José M. Sigarreta

Ramsey proved that for every positive integer $n$, every sufficiently large graph contains an induced $K_n$ or $\overline{K}_n$. Among the many extensions of Ramsey's Theorem there is an analogue for connected graphs: for every positive…

Combinatorics · Mathematics 2023-06-16 Sarah Allred , Guoli Ding , Bogdan Oporowski