2007/01/15 by Jesse Campbell, J. Campbell, Campbell, J. +15
Computer Science · Engineering · Mathematics · #05C10 (Primary) 57M15 #05C35 (Secondary) #Advanced Graph Theory Research #FOS: Mathematics #Geometric Topology (math.GT) #Limits and Structures in Graph Theory #graph theory and CDMA systems #math.GT #msc:05C10 #msc:05C35 #msc:57M15
paper · pdf · doi:10.48550/arxiv.math/0701422
16 pages, 4 figures
arxiv created 2007/01/15 · openalex publication_date 2007/01/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We 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.