A proof of the bounded graph conjecture.

Reinhard Diestel; Imre Leader

Inventiones mathematicae (1992)

  • Volume: 108, Issue: 1, page 131-162
  • ISSN: 0020-9910; 1432-1297/e

How to cite

top

Diestel, Reinhard, and Leader, Imre. "A proof of the bounded graph conjecture.." Inventiones mathematicae 108.1 (1992): 131-162. <http://eudml.org/doc/143991>.

@article{Diestel1992,
author = {Diestel, Reinhard, Leader, Imre},
journal = {Inventiones mathematicae},
keywords = {ray; countable graphs; characterization; minors; bounded graphs},
number = {1},
pages = {131-162},
title = {A proof of the bounded graph conjecture.},
url = {http://eudml.org/doc/143991},
volume = {108},
year = {1992},
}

TY - JOUR
AU - Diestel, Reinhard
AU - Leader, Imre
TI - A proof of the bounded graph conjecture.
JO - Inventiones mathematicae
PY - 1992
VL - 108
IS - 1
SP - 131
EP - 162
KW - ray; countable graphs; characterization; minors; bounded graphs
UR - http://eudml.org/doc/143991
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.