Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs
Combinatorics
2015-03-18 v1
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.
Keywords
Cite
@article{arxiv.1102.0693,
title = {Ends and vertices of small degree in infinite minimally k-(edge)-connected graphs},
author = {Maya Stein},
journal= {arXiv preprint arXiv:1102.0693},
year = {2015}
}
Comments
15 pages