2004/12/01 by Garry Bowlin, Joel Foisy · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Combinatorics #Computer science #Discrete mathematics #Embedding #Graph #Interconnection Networks and Systems #Link (geometry) #Mathematics #graph theory and CDMA systems
paper · doi:10.1142/s0218216504003652
openalex publication_date 2004/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/11
In [2], it was shown that every spatial embedding of K 10 , the complete graph on ten vertices, contains a non-split 3-component link (K 10 is intrinsically 3-linked). We improve this result by exhibiting two different subgraphs of K 10 that also have this property. In addition, we also exhibit several families of graphs that are intrinsically 3-linked.