Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1804.01921 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916737562181632 |
|---|---|
| author | Diestel, Reinhard Kneip, Jay Lilian |
| author_facet | Diestel, Reinhard Kneip, Jay Lilian |
| contents | Separation 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1804_01921 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Profinite separation systems Diestel, Reinhard Kneip, Jay Lilian Combinatorics 03E04, 06A07, 05C40, 20E18, 30D40. 91C20 Separation 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. |
| title | Profinite separation systems |
| topic | Combinatorics 03E04, 06A07, 05C40, 20E18, 30D40. 91C20 |
| url | https://arxiv.org/abs/1804.01921 |