Ends and vertices of small degree in infinite minimally k-(Edge)-connected graphs

DOI10.1137/100783686MaRDI QIDQ3013149zbMATH OpenOpenAlexFDO

Authors Maya Stein

Publication date 18 July 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimum degreedegreeinfinite graph\(k\)-connectivityvertex-minimaledge-minimal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Infinite graphs (05C63)

Abstract: Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show that most of these carry over to infinite graphs if we consider ends of small degree as well as vertices.

Recommendations

• The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
• On Vertices of Degree n in Minimally n-Edge-Connected Graphs
• A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
• Vertices of degree \(k\) in a minimally \(k\)-edge-connected digraph
• scientific article; zbMATH DE number 878899

Cited in

(7)

• Infinite Ramsey-minimal graphs for star forests
• Minimax theorems for infinite graphs with the ends as ideal points
• On end degrees and infinite cycles in locally finite graphs
• Extremal infinite graph theory
• Characterising \(k\)-connected sets in infinite graphs
• Contractible edges in \(k\)-connected infinite graphs
• The relative degree and large complete minors in infinite graphs

This page was built for publication: Ends and vertices of small degree in infinite minimally \(k\)-(Edge)-connected graphs

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