Intrinsic knotting and linking of almost complete graphs

Simple item page
dc.creatorCampbell, J.
dc.creatorMattman, T. W.
dc.creatorOttman, R.
dc.creatorPyzer, J.
dc.creatorRodrigues, M.
dc.creatorWilliams, S.
dc.date2007-01-15
dc.date.accessioned2026-07-07T07:41:02Z
dc.date.available2026-07-07T07:41:02Z
dc.descriptionWe introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also 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.
dc.description16 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0701422
dc.identifierhttp://arxiv.org/abs/math/0701422
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121963
dc.subjectGeometric Topology
dc.subject05C10 (Primary) 57M15, 05C35 (Secondary)
dc.titleIntrinsic knotting and linking of almost complete graphs
dc.typetext

Files

Collections

arXiv