Immersion in four-edge-connected graphs

Maria Chudnovsky, Zdeněk Dvořák, Tereza Klimošová, Paul Seymour

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

Fix g > 1. Every graph of large enough tree-width contains a g× g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g× 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.

Original languageEnglish (US)
Pages (from-to)208-218
Number of pages11
JournalJournal of Combinatorial Theory. Series B
Volume116
DOIs
StatePublished - Jan 2016

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Keywords

  • Graph immersion
  • Grid minors

Fingerprint Dive into the research topics of 'Immersion in four-edge-connected graphs'. Together they form a unique fingerprint.

  • Cite this