Excluding a full grid minor

Karl Heuer

doi:10.1007/s12188-016-0165-y

Excluding a full grid minor

Combinatorics 2018-12-06 v2

Authors: Karl Heuer

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

In this paper we characterise the graphs containing a $\mathbb{Z} \times \mathbb{Z}$ grid minor in a similar way as it has been done by Halin for graphs with an $\mathbb{N} \times \mathbb{Z}$ grid minor. Using our characterisation, we describe the structure of graphs without $\mathbb{Z} \times \mathbb{Z}$ grid minors in terms of tree-decompositions.

Cite

@article{arxiv.1510.03599,
  title  = {Excluding a full grid minor},
  author = {Karl Heuer},
  journal= {arXiv preprint arXiv:1510.03599},
  year   = {2018}
}

Comments

11 pages, 2 figures; former formulation of $(ii)$ of Theorem 1.4 is now split into $(ii)$ and $(iii)$ to avoid misunderstanding

Related papers

View all related →