Bipartite intrinsically knotted graphs with 23 edges

DOI10.1016/J.DISC.2022.113022MaRDI QIDQ2166281zbMATH OpenOpenAlexFDO

Authors Hyoungjun Kim, Seungsang Oh, T. Mattman

Publication date 24 August 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

graph embeddingintrinsically knotted

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Graph theory (05Cxx) Manifolds and cell complexes (57-XX)

Recommendations

• Bipartite intrinsically knotted graphs with 22 edges
• A new intrinsically knotted graph with 22 edges
• More intrinsically knotted graphs with 22 edges and the restoring method
• Exactly fourteen intrinsically knotted graphs have 21 edges
• A sufficient condition for intrinsic knotting of bipartite graphs

Cites work

• A new intrinsically knotted graph with 22 edges
• Bipartite intrinsically knotted graphs with 22 edges
• Exactly fourteen intrinsically knotted graphs have 21 edges
• Graph minors. XX: Wagner's conjecture
• Graphs of 20 edges are 2-apex, hence unknotted
• Graphs on 21 edges that are not 2-apex
• INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
• Many, many more intrinsically knotted graphs
• More intrinsically knotted graphs with 22 edges and the restoring method
• Primitive spatial graphs and graph minors
• Recent developments in spatial graph theory
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS

Cited in

(1)

• Bipartite intrinsically knotted graphs with 23 edges

This page was built for publication: Bipartite intrinsically knotted graphs with 23 edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2166281)