A sufficient condition for intrinsic knotting of bipartite graphs

zbMATH Open1231.57003arXiv0811.0036MaRDI QIDQ3000371FDOQ3000371

Authors: Sophy Huck, Alexandra Appel, Miguel-Angel Manrique, T. Mattman 

Publication date: 18 May 2011

Abstract: 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 bipartite graph with exactly n geq 5 vertices in one part and |E(G)| geq 4 |V(G)| + C_n is intrinsically knotted. Finally, we classify bipartite graphs with ten or fewer vertices with respect to intrinsic knotting.

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

Recommendations

• Bipartite intrinsically knotted graphs with 22 edges
• Intrinsic knotting and linking of almost complete graphs
• Intrinsic knotting of almost complete partite graphs
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• More intrinsically knotted graphs with 22 edges and the restoring method

zbMATH Keywords

bipartiteintrinsically knotted

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Cited In (3)

• Bipartite intrinsically knotted graphs with 22 edges
• Intrinsic knotting of almost complete partite graphs
• Two More Proofs that the Kinoshita Graph is Knotted

This page was built for publication: A sufficient condition for intrinsic knotting of bipartite graphs

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