Pith. sign in

REVIEW 1 cited by

Trees of tangles in infinite separation systems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2005.12122 v4 pith:BLKL63LG submitted 2020-05-25 math.CO

Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen This is my paper · ORCID
classification math.CO
keywords infiniteseparationsystemsabstracttanglestreesanaloguesarxiv
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present infinite analogues of our splinter lemma from [Trees of tangles in abstract separation systems, arXiv:1909.09030]. From these we derive several tree-of-tangles-type theorems for infinite graphs and infinite abstract separation systems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On vertex sets inducing tangles

    math.CO 2024-11 conditional novelty 7.0 of 10

    Every k-tangle in a graph is the lift of a k-tangle in a topological minor of size bounded by a function of k, reducing the vertex-set induction problem to bounded-size graphs.

Pith tools