Immersion in four-edge-connected graphs

Maria Chudnovsky; Paul Seymour; Tereza Klimo\v{s}ov\'a; Zden\v{e}k Dvo\v{r}\'ak

REVIEW

Immersion in four-edge-connected graphs

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 1308.0827 v1 pith:EYCWWC6F submitted 2013-08-04 math.CO cs.DM

Maria Chudnovsky , Zdeněk Dvořák , Tereza Klimošová , Paul Seymour This is my paper · ORCID

classification math.COcs.DM

keywords containsgraphimmersionenougheveryfour-edge-connectedgridlarge

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g grid as an immersion (and hence contains any fixed graph with maximum degree at most four as an immersion). This result has a number of applications.

Discussion (0). Continue with ORCID to comment.

Pith tools