scholarly journals Trees of tangles in infinite separation systems

Author(s):  
CHRISTIAN ELBRACHT ◽  
JAKOB KNEIP ◽  
MAXIMILIAN TEEGEN

Abstract We present infinite analogues of our splinter lemma for constructing nested sets of separations. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation systems.

Order ◽  
2019 ◽  
Vol 37 (1) ◽  
pp. 179-205
Author(s):  
Reinhard Diestel ◽  
Jakob Kneip

AbstractSeparation systems are posets with additional structure that form an abstract setting in which tangle-like clusters in graphs, matroids and other combinatorial structures can be expressed and studied. This paper offers some basic theory about infinite separation systems and how they relate to the finite separation systems they induce. They can be used to prove tangle-type duality theorems for infinite graphs and matroids, which will be done in future work that will build on this paper.


2021 ◽  
Vol 377 ◽  
pp. 107470
Author(s):  
Reinhard Diestel ◽  
Sang-il Oum
Keyword(s):  

2014 ◽  
Vol 49 (1) ◽  
pp. 221-233 ◽  
Author(s):  
Tewodros Beyene ◽  
Swarat Chaudhuri ◽  
Corneliu Popeea ◽  
Andrey Rybalchenko
Keyword(s):  

2019 ◽  
Vol 22 (5) ◽  
pp. 837-844
Author(s):  
Gareth Wilkes

Abstract We establish conditions under which the fundamental group of a graph of finite p-groups is necessarily residually p-finite. The technique of proof is independent of previously established results of this type, and the result is also valid for infinite graphs of groups.


Sign in / Sign up

Export Citation Format

Share Document