An infinite family of linklessly embeddable Tutte-4-connected graphs

2021/06/15 by Andrei Pavelescu, Pavelescu, Andrei, Elena Pavelescu +1
Computer Science · Engineering · Mathematics · #05C10 #57M15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Geometric Topology (math.GT) #graph theory and CDMA systems #math.CO #math.GT #msc:05C10 #msc:57M15

paper · pdf · doi:10.48550/arxiv.2106.08018

8 pages, 13 figures

arxiv created 2021/06/15 · openalex publication_date 2021/06/15 · arxiv updated 2021/06/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For each n≥ 14, we provide an example of a linklessly embeddable, Tutte-4-connected graph of order n.

Related

• Strengthened chain theorems for different versions of 4-connectivity
• The Complement Problem for Linklessly Embeddable Graphs
• Intrinsically Linked Graphs with Knotted Components
• Linkless and flat embeddings in 3-space and the unknot problem
• Structure and enumeration of K4-minor-free links and link-diagrams