Profinite separation systems

From MaRDI portal
Publication:2183105

DOI10.1007/S11083-019-09499-YzbMATH Open1481.06007arXiv1804.01921OpenAlexW2994778308WikidataQ126620070 ScholiaQ126620070MaRDI QIDQ2183105FDOQ2183105


Authors: Reinhard Diestel, Jakob Kneip Edit this on Wikidata


Publication date: 26 May 2020

Published in: Order (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1804.01921




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Profinite separation systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183105)