Forcing highly connected subgraphs

DOI10.1002/JGT.20216MaRDI QIDQ3437007zbMATH OpenOpenAlexFDO

Authors Maya Stein

Publication date 11 May 2007

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20216

zbMATH Keywords

connectednessedge-degreeextremal infinite graph theoryvertex-degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Forcing large complete (topological) minors in infinite graphs
• Ends and vertices of small degree in infinite minimally k-(Edge)-connected graphs
• Isolating highly connected induced subgraphs
• Large k‐preserving sets in infinite graphs
• A connected subgraph maintaining high connectivity

Cited in

(10)

• Forcing finite minors in sparse infinite graphs by large-degree assumptions
• Extremal infinite graph theory
• Graph topologies induced by edge lengths
• Isolating highly connected induced subgraphs
• The relative degree and large complete minors in infinite graphs
• Forcing large complete (topological) minors in infinite graphs
• Duality of ends
• Infinite Ramsey-minimal graphs for star forests
• Locally finite graphs with ends: A topological approach. II: Applications
• Connected but not path-connected subspaces of infinite graphs

This page was built for publication: Forcing highly connected subgraphs

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