Geodesic
Quickly proving Diestel's normal spanning tree criterion
Max Pitz1
1University of Hamburg
The electronic journal of combinatorics, Tome 28 (2021) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We present two short proofs for Diestel's criterion that a connected graph has a normal spanning tree provided it contains no subdivision of a countable clique in which every edge has been replaced by uncountably many parallel edges.
DOI : 10.37236/9619
Classification : 05C05, 05C63
Mots-clés : Diestel's criterion

Max Pitz  1

1 University of Hamburg 
@article{10_37236_9619,
     author = {Max Pitz},
     title = {Quickly proving {Diestel's} normal spanning tree criterion},
     journal = {The electronic journal of combinatorics},
     year = {2021},
     volume = {28},
     number = {3},
     doi = {10.37236/9619},
     zbl = {1478.05024},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/9619/}
}
TY  - JOUR
AU  - Max Pitz
TI  - Quickly proving Diestel's normal spanning tree criterion
JO  - The electronic journal of combinatorics
PY  - 2021
VL  - 28
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/9619/
DO  - 10.37236/9619
ID  - 10_37236_9619
ER  - 
%0 Journal Article
%A Max Pitz
%T Quickly proving Diestel's normal spanning tree criterion
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/9619/
%R 10.37236/9619
%F 10_37236_9619
Max Pitz. Quickly proving Diestel's normal spanning tree criterion. The electronic journal of combinatorics, Tome 28 (2021) no. 3. doi: 10.37236/9619

Cité par Sources :