A new intrinsically knotted graph with 22 edges
From MaRDI portal
Publication:2401569
DOI10.1016/j.topol.2017.06.013zbMath1369.05150arXiv1407.3460OpenAlexW2711839916MaRDI QIDQ2401569
Hwa Jeong Lee, Minjung Lee, Hyoungjun Kim, Seungsang Oh, Thomas W. Mattman
Publication date: 4 September 2017
Published in: Topology and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.3460
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Bipartite intrinsically knotted graphs with 23 edges ⋮ Recent developments in spatial graph theory ⋮ More intrinsically knotted graphs with 22 edges and the restoring method
Cites Work
- 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
- Exactly fourteen intrinsically knotted graphs have 21 edges
- Many, many more intrinsically knotted graphs
- Primitive spatial graphs and graph minors
- Graphs on 21 edges that are not 2-apex
- Knots and links in spatial graphs
- INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
- Intrinsically knotted graphs
- SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
This page was built for publication: A new intrinsically knotted graph with 22 edges