Intrinsic knotting and linking of almost complete partite graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is removed from an intrinsically knotted graph, one obtains an intrinsically linked graph.
v2: 20 pages, 10 figures, substantial expansion of version 1

Keywords

Geometric Topology, 05C10 (Primary) 57M15 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/69519

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0312176
 http://arxiv.org/abs/math/0312176

Collections

arXiv