pith. sign in

arxiv: 1308.0827 · v1 · pith:EYCWWC6Fnew · submitted 2013-08-04 · 🧮 math.CO · cs.DM

Immersion in four-edge-connected graphs

Maria Chudnovsky , Zden\v{e}k Dvo\v{r}\'ak , Tereza Klimo\v{s}ov\'a , Paul Seymour This is my paper
classification 🧮 math.CO cs.DM
keywords containsgraphimmersionenougheveryfour-edge-connectedgridlarge
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.