Forcing finite minors in sparse infinite graphs by large-degree assumptions
Abstract
Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum degree. This is part of a wider project which seeks to develop an extremal theory of sparse infinite graphs.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2012
- DOI:
- arXiv:
- arXiv:1209.5318
- Bibcode:
- 2012arXiv1209.5318D
- Keywords:
-
- Mathematics - Combinatorics