Excluding a full grid minor

DOI10.1007/S12188-016-0165-YMaRDI QIDQ1688263zbMATH OpenOpenAlexFDO

Authors Karl Heuer

Publication date 5 January 2018

Published in Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.03599

zbMATH Keywords

endsgrid minorinfinite graphsinfinite gridtree-decomposition

Mathematics Subject Classification ID

Trees (05C05) Infinite graphs (05C63) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Abstract: In this paper we characterise the graphs containing a $mathbbZimesmathbbZ$ grid minor in a similar way as it has been done by Halin for graphs with an $mathbbNimesmathbbZ$ grid minor. Using our characterisation, we describe the structure of graphs without $mathbbZimesmathbbZ$ grid minors in terms of tree-decompositions.

Recommendations

• Minor-equivalence for infinite graphs
• Graph minors. V. Excluding a planar graph
• Quickly excluding a planar graph
• scientific article; zbMATH DE number 475606
• Minor-universal planar graphs without accumulation points

Cites work

• A short proof of Halin's grid theorem
• Excluding infinite clique minors
• Extremal infinite graph theory
• Graph theory
• Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
• Simplicial Decompositions of Infinite Graphs
• Über die Maximalzahl fremder unendlicher Wege in Graphen

Cited in

(4)

• Ends and tangles
• Excluding a small minor
• A strengthening of Halin's grid theorem
• Infinite grids in digraphs

This page was built for publication: Excluding a full grid minor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688263)