Many, many more intrinsically knotted graphs
From MaRDI portal
Publication:2453739
DOI10.2140/AGT.2014.14.1801zbMath1292.05091arXiv1109.1632OpenAlexW3098398230MaRDI QIDQ2453739
Ramin Naimi, Noam Goldberg, Thomas W. Mattman
Publication date: 10 June 2014
Published in: Algebraic \& Geometric Topology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1632
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (19)
Tree densities in sparse graph classes ⋮ Ideal spatial graph configurations ⋮ Bipartite intrinsically knotted graphs with 23 edges ⋮ A new intrinsically knotted graph with 22 edges ⋮ The minor minimal intrinsically chiral graphs ⋮ Linearly free graphs ⋮ Family sizes for complete multipartite graphs ⋮ Maximal knotless graphs ⋮ Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant ⋮ Complete minors in complements of nonseparating planar graphs ⋮ Many, many more intrinsically knotted graphs ⋮ Recent developments in spatial graph theory ⋮ Order nine MMIK graphs ⋮ The 𝐾_{𝑛+5} and 𝐾_{3²,1ⁿ} families and obstructions to 𝑛-apex. ⋮ More intrinsically knotted graphs with 22 edges and the restoring method ⋮ Forbidden minors: finding the finite few ⋮ Dips at small sizes for topological graph obstruction sets ⋮ Chirality for simple graphs of size up to 12 ⋮ Bipartite Intrinsically Knotted Graphs with 22 Edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graphs of 20 edges are 2-apex, hence unknotted
- On intrinsically knotted or completely 3-linked graphs
- Graph minors. XX: Wagner's conjecture
- Sachs' linkless embedding conjecture
- Many, many more intrinsically knotted graphs
- Primitive spatial graphs and graph minors
- The Y-triangle move does not preserve intrinsic knottedness
- Knots and links in spatial graphs
- Intrinsically knotted graphs
- A newly recognized intrinsically knotted graph
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
- An Algorithm for Detecting Intrinsically Knotted Graphs
- Realization of knots and links in a spatial graph
This page was built for publication: Many, many more intrinsically knotted graphs