HIGHLIGHTS
- who: Math. Proc. Camb. Phil. and collaborators from the Universität Hamburg, Bundesstraße, Hamburg, Germany have published the research work: Trees of tangles in infinite separation systems, in the Journal: (JOURNAL)
- what: With this approach the authors show that in an arbitrary graph you can find a canonical nested set of separators which efficiently distinguishes all the robust regular profiles in G. The authors propose that this set of separators is a natural intermediate object for distinguishing profiles. The authors show that there is a component C of G - X such that Y ⊆ C . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.