Geodesic
Forcing finite minors in sparse infinite graphs by large-degree assumptions
The electronic journal of combinatorics, Tome 22 (2015) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 or average degree. This is part of a wider project which seeks to develop an extremal theory of sparse infinite graphs.
DOI : 10.37236/2891
Classification : 05C42, 05C07, 05C35, 05C63, 05C83
Mots-clés : relative end degrees in infinite graphs, density, forcing minors, extremal theory of sparse infinite graphs 
@article{10_37236_2891,
     author = {Reinhard Diestel},
     title = {Forcing finite minors in sparse infinite graphs by large-degree assumptions},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {1},
     doi = {10.37236/2891},
     zbl = {1308.05066},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2891/}
}
TY  - JOUR
AU  - Reinhard Diestel
TI  - Forcing finite minors in sparse infinite graphs by large-degree assumptions
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2891/
DO  - 10.37236/2891
ID  - 10_37236_2891
ER  - 
%0 Journal Article
%A Reinhard Diestel
%T Forcing finite minors in sparse infinite graphs by large-degree assumptions
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/2891/
%R 10.37236/2891
%F 10_37236_2891
Reinhard Diestel. Forcing finite minors in sparse infinite graphs by large-degree assumptions. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/2891

Cité par Sources :