A strengthening of Halin's grid theorem

DOI10.1112/MTK.12135MaRDI QIDQ6074968zbMATH OpenOpenAlexWikidataFDO

Authors Jan Kurkofka, Ruben Melcher, Max F. Pitz

Publication date 20 September 2023

Published in Mathematika (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

disjoint infinite pathshomeomorphic embeddings

Mathematics Subject Classification ID

Connectivity (05C40) Infinite graphs (05C63) Structural characterization of families of graphs (05C75)

Abstract: We show that for every infinite collection $mathcalR$ of disjoint equivalent rays in a graph $G$ there is a subdivision of the hexagonal half-grid in $G$ such that all its vertical rays belong to $mathcalR$. This result strengthens Halin's grid theorem by giving control over which specific set of rays is used, while its proof is significantly shorter.

Recommendations

• A short proof of Halin's grid theorem
• Edge-disjoint double rays in infinite graphs: a Halin type result
• An accessibility theorem for infinite graph minors
• scientific article; zbMATH DE number 475606
• Almost reconstructing infinite, rayless graphs

Cites work

• A problem in infinite graph-theory
• A short proof of Halin's grid theorem
• Excluding a full grid minor
• Excluding infinite clique minors
• Halin's end degree conjecture
• Über die Maximalzahl fremder unendlicher Wege in Graphen

Cited in

(5)

• A short proof of Halin's grid theorem
• Edge-disjoint double rays in infinite graphs: a Halin type result
• A survey of grid diagrams and a proof of Alexander's theorem
• The immersion-minimal infinitely edge-connected graph
• A coarse Halin Grid theorem with applications to quasi-transitive, locally finite graphs

This page was built for publication: A strengthening of Halin's grid theorem

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