Two Analogs of Intrinsically Linked Graphs

Simple item page
dc.creatorCicotta, Chris
dc.creatorFoisy, Joel
dc.creatorReilly, Tom
dc.creatorRevzi, Sara
dc.creatorWang, Ben
dc.creatorWilson, Alice
dc.date2007-07-24
dc.date.accessioned2026-07-07T08:19:58Z
dc.date.available2026-07-07T08:19:58Z
dc.descriptionA graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked if and only if it is not outer-planar. A graph is outer-flat if it can be embedded in the 3-ball such that all of its vertices map to the boundary of the 3-ball, all edges to the interior, and every cycle bounds a disk in the 3-ball that meets the graph only along its boundary. We show that a graph is outer-flat if and only if it is planar.
dc.description10 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0707.3615
dc.identifierhttp://arxiv.org/abs/0707.3615
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134951
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject57M15 (Primary); 57M25, 05C10 (Secondary)
dc.titleTwo Analogs of Intrinsically Linked Graphs
dc.typetext

Files

Collections

arXiv