A proof of the bounded graph conjecture.
Diestel, Reinhard ; Leader, Imre
Inventiones mathematicae, Tome 110 (1992), p. 131-162 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1992-01-01
EUDML-ID : urn:eudml:doc:143991 
@article{GDZPPN00210962X,
     title = {A proof of the bounded graph conjecture.},
     journal = {Inventiones mathematicae},
     volume = {110},
     year = {1992},
     pages = {131-162},
     zbl = {0793.05121},
     url = {http://dml.mathdoc.fr/item/GDZPPN00210962X}
}

Diestel, Reinhard; Leader, Imre. A proof of the bounded graph conjecture.. Inventiones mathematicae, Tome 110 (1992) pp. 131-162. http://gdmltest.u-ga.fr/item/GDZPPN00210962X/