Forcing finite minors in sparse infinite graphs by large-degree assumptions

zbMath1308.05066arXiv1209.5318MaRDI QIDQ2260615

Reinhard Diestel

Publication date: 11 March 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

densityextremal theory of sparse infinite graphsforcing minorsrelative end degrees in infinite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83) Vertex degrees (05C07) Infinite graphs (05C63) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
• End spaces and spanning trees
• Extremal infinite graph theory
• Forcing Large Complete (Topological) Minors in Infinite Graphs
• Forcing highly connected subgraphs
• Über die Maximalzahl fremder unendlicher Wege in Graphen

This page was built for publication: Forcing finite minors in sparse infinite graphs by large-degree assumptions