REVIEW 1 cited by
A grid theorem for strong immersions of walls
Not yet reviewed by Pith; the record is open.
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
A grid theorem for strong immersions of walls
read the original abstract
We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small `width', which is measured in terms of its adhesion and the path-likeness of its torsos.
Forward citations
Cited by 1 Pith paper
-
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
Every K_{1,d}-free graph that excludes the k-ladder as an induced minor has tree-independence number bounded by a function of k and d.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.