arXiv research

Survey of intrinsically linked or knotted graphs.

New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.

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, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is remo…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respe…

New research finds six bipartite intrinsically knotted graphs with 23 edges.

We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.

Johnson, Kidwell, and Michael showed that intrinsically knotted graphs have at least 21 edges. Also it is known that K7 and the thirteen graphs obtained from K7 by rY moves are intrinsically knotted graphs with 21 edges. We prove that these 14 graphs are the only intrinsically knotted graphs with 21 edges.

Two new minor minimal intrinsically chiral graphs identified.

A graph is intrinsically knotted if every embedding contains a knotted cycle. It is known that intrinsically knotted graphs have at least 21 edges and that the KS graphs, $K_7$ and the 13 graphs obtained from $K_7$ by $\nabla Y$ moves, are the only minor minimal intrinsically knotted graphs with 21 edges. This set incl…

Graphs and their complements are intrinsically knotted.

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…

We examine graphs that contain a non-trivial link in every embedding into real projective space, using a weaker notion of unlink than was used by Flapan, et al. We call such graphs intrinsically linked in projective space. We fully characterize such graphs with connectivity 0,1 and 2. We also show that only one Peterse…

Study shows stable graphs in Heisenberg group are essentially planes.

We prove that a graph is intrinsically linked in an arbitrary 3-manifold M if and only if it is intrinsically linked in S^3. Also, assuming the Poincare Conjecture, we prove that a graph is intrinsically knotted in M if and only if it is intrinsically knotted in S^3.

The paper studies maps in the Heisenberg group and their images, called Rickman rugs.

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, independently, Barsotti and Mattman, showed that $K_7$ and the 13 graphs obtained from $K_7$…

The paper studies harmonic graphs in the Heisenberg group and their properties.

Study uniformly differentiable graphs in Carnot groups, proving area formulas.

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, Lee and Oh, and, independently, Barsotti and Mattman, showed that $K_7$ and the …

A directed graph $G$ is $\textit{intrinsically linked}$ if every embedding of that graph contains a non-split link $L$, where each component of $L$ is a consistently oriented cycle in $G$. A $\textit{tournament}$ is a directed graph where each pair of vertices is connected by exactly one directed edge. We consider intr…

We list more than 200 new examples of minor minimal intrinsically knotted graphs and describe many more that are intrinsically knotted and likely minor minimal.

We classify which complete multipartite graphs are intrinsically chiral.

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 these filtrations are descending and non-terminating. We also provide several ex…

This paper classifies chiral graphs up to size 12.

We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph obtained from the complete graph on seven vertices by a finite sequence of $\tria…

We answer the question "Does the Y-triangle move preserve intrinsic knottedness?" in the negative by giving an example of a graph that is obtained from the intrinsically knotted graph K_7 by triangle-Y and Y-triangle moves but is not intrinsically knotted.

Flapan--Naimi--Pommersheim showed that every spatial embedding of $K_{10}$, the complete graph on ten vertices, contains a non-split three-component link; that is, $K_{10}$ is intrinsically triple-linked in $\mathbb{R}^3$. The work of Bowlin--Foisy and Flapan--Foisy--Naimi--Pommersheim extended the list of known intrin…

The paper proves Rademacher's theorem for Heisenberg groups.

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 vertices in one part. We also show that there is a constant C_n such that a bipa…

Criterion for surfaces in Heisenberg group to be graphs using flat cones.

We focus our attention on the notion of intrinsic Lipschitz graphs, inside a special class of metric spaces i.e. the Carnot groups. More precisely, we provide a characterization of locally intrinsic Lipschitz functions in Carnot groups of step 2 in terms of their intrinsic distributional gradients.

Study area and coarea formulas for graphs and submanifolds in Carnot groups.

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edg…

This paper introduces a number of new intrinsically 3-linked graphs through five new constructions. We then prove that intrinsic 3-linkedness is not preserved by $\text{Y}\nabla$ moves. We will see that the graph $M$, which is obtained through a $\text{Y}\nabla$ move on $(PG)^*_*(PG)$, is not intrinsically 3-linked.

We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are intrinsically knotted and, for $k \geq 2n+9$, most of order $k$ are not $n$-apex…

We prove that a family of entire intrinsic minimal graphs in the Heisenberg group are not perimeter minimizing.

Solves Plateau's Problem in Heisenberg group for graphs.

We prove that Lipschitz intrinsic graphs in the Heisenberg groups $H^n$, with $n>1$, which are vanishing viscosity solutions of the minimal surface equation are smooth.

Graph Ricci flow reveals hidden hierarchies in stock market correlations.

Introduces intrinsically Lipschitz graphs in metric spaces.

This paper identifies all topological symmetry groups for Heawood family graphs.

A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked if and only if it is not outer-planar. A graph is outer-flat if it can be embed…

We prove that, in the first Heisenberg group $\mathbb{H}$, an entire locally Lipschitz intrinsic graph admitting vanishing first variation of its sub-Riemannian area and non-negative second variation must be an intrinsic plane, i.e., a coset of a two dimensional subgroup of $\mathbb{H}$. Moreover two examples are given…

We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by Goldberg, Mattman, and Naimi [6] to greatly expand the list of known minor minima…

New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.

The paper studies properties of intrinsically Lipschitz constants in metric spaces.

This paper studies rectifiability in Carnot groups and proves geometric area formulas.

We show that the 14 graphs obtained by $\nabla\mathrm{Y}$ moves on K_7 constitute a complete list of the minor minimal intrinsically knotted graphs on 21 edges. We also present evidence in support of a conjecture that the 20 graph Heawood family, obtained by a combination of $\nabla\mathrm{Y}$ and $\mathrm{Y}\nabla$ mo…