Immersion in four-edge-connected graphs
Author(s): Chudnovsky, Maria; Dvořák, Zdeněk; Klimošová, Tereza; Seymour, Paul D.
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1832f| 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. |
| Publication Date: | Jan-2016 |
| Electronic Publication Date: | 11-Aug-2015 |
| Citation: | [10] M. Chudnovsky, Z. Dvorak, T. Klimosova, P. Seymour, Immersion in four-edge-connected graphs, J. Combin. Theory Ser. B 116 (2016) 208–218. |
| DOI: | 10.1016/j.jctb.2015.07.006 |
| Pages: | 208-218 |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | Journal of combinatorial theory. Series B. |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.