A sufficient condition for intrinsic knotting of bipartite graphs

Simple item page
dc.creatorHuck, Sophy
dc.creatorAppel, Alexandra
dc.creatorManrique, Miguel-Angel
dc.creatorMattman, Thomas W
dc.date2008-10-31
dc.date.accessioned2026-07-07T10:14:42Z
dc.date.available2026-07-07T10:14:42Z
dc.descriptionWe 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.
dc.description10 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/0811.0036
dc.identifierhttp://arxiv.org/abs/0811.0036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/172971
dc.subjectGeometric Topology
dc.subject05C10 (Primary), 57M15, 05C35 (Secondary)
dc.titleA sufficient condition for intrinsic knotting of bipartite graphs
dc.typetext

Files

Collections

arXiv