Bipartite Intrinsically Knotted Graphs with 22 Edges

DOI10.1002/jgt.22091zbMath1369.05050arXiv1411.1837OpenAlexW2951226931MaRDI QIDQ5272935

Hyoungjun Kim, Thomas W. Mattman, Seungsang Oh

Publication date: 5 July 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1837

zbMATH Keywords

Heawood subgraphintrinsically knotted bipartite graphs

Mathematics Subject Classification ID

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 (5)

Bipartite intrinsically knotted graphs with 23 edges ⋮ The minor minimal intrinsically chiral graphs ⋮ Linearly free graphs ⋮ More intrinsically knotted graphs with 22 edges and the restoring method ⋮ Chirality for simple graphs of size up to 12

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
• The Y-triangle move does not preserve intrinsic knottedness
• Graphs on 21 edges that are not 2-apex
• A sufficient condition for intrinsic knotting of bipartite graphs
• 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: Bipartite Intrinsically Knotted Graphs with 22 Edges