Geodesic
A proof of the bounded graph conjecture.
Inventiones mathematicae, Tome 108 (1992) no. 2, pp. 131-162.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : ray, countable graphs, characterization, minors, bounded graphs 
@article{IM_1992__108_2_143991,
     author = {Reinhard Diestel and Imre Leader},
     title = {A proof of the bounded graph conjecture.},
     journal = {Inventiones mathematicae},
     pages = {131--162},
     publisher = {mathdoc},
     volume = {108},
     number = {2},
     year = {1992},
     zbl = {0793.05121},
     url = {http://geodesic.mathdoc.fr/item/IM_1992__108_2_143991/}
}
TY  - JOUR
AU  - Reinhard Diestel
AU  - Imre Leader
TI  - A proof of the bounded graph conjecture.
JO  - Inventiones mathematicae
PY  - 1992
SP  - 131
EP  - 162
VL  - 108
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IM_1992__108_2_143991/
ID  - IM_1992__108_2_143991
ER  - 
%0 Journal Article
%A Reinhard Diestel
%A Imre Leader
%T A proof of the bounded graph conjecture.
%J Inventiones mathematicae
%D 1992
%P 131-162
%V 108
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IM_1992__108_2_143991/
%F IM_1992__108_2_143991
Reinhard Diestel; Imre Leader. A proof of the bounded graph conjecture.. Inventiones mathematicae, Tome 108 (1992) no. 2, pp. 131-162. http://geodesic.mathdoc.fr/item/IM_1992__108_2_143991/