Problem
Research questions and friction points this paper is trying to address.
Characterizing 4-tangles via connectivity properties
Relaxing k-connectedness for cohesive graph-minors
Proving internally 4-connected graphs have unique 4-tangles
Characterising 4-tangles through a connectivity property
🤖 AI Summary
This paper addresses the structural characterization of 4-tangles: for (k = 4), can the classical (k)-connectivity condition be weakened to establish an exact correspondence with highly cohesive subgraphs? The study establishes that an internally 4-connected graph contains exactly one 4-tangle, and further proves that any graph admitting a 4-tangle must contain an internally 4-connected subgraph whose unique 4-tangle naturally extends to a 4-tangle of the original graph. By integrating graph minor theory, connectivity analysis, and structural induction, the paper provides a purely combinatorial characterization of 4-tangles—overcoming the long-standing theoretical barrier that (k)-connectivity fails to capture (k)-tangles for (k geq 4). This breakthrough lays a foundational cornerstone for the classification and structural theory of higher-order tangles.
📝 Abstract
Every large $k$-connected graph-minor induces a $k$-tangle in its ambient graph. The converse holds for $kle 3$, but fails for $kge 4$. This raises the question whether `$k$-connected' can be relaxed to obtain a characterisation of $k$-tangles through highly cohesive graph-minors. We show that this can be achieved for $k=4$ by proving that internally 4-connected graphs have unique 4-tangles, and that every graph with a 4-tangle $ au$ has an internally 4-connected minor whose unique 4-tangle lifts to~$ au$.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Uses internally 4-connected graph minors
Links 4-tangles to cohesive minors
Proves unique 4-tangles in minors
🔎 Similar Papers
No similar papers found.
