Geodesic
A simple existence criterion for normal spanning trees
Reinhard Diestel1
1Mathematisches Seminar, Hamburg University Germany
The electronic journal of combinatorics, Tome 23 (2016) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Halin proved in 1978 that there exists a normal spanning tree in every connected graph $G$ that satisfies the following two conditions: (i) $G$ contains no subdivision of a `fat' $K_{\aleph_0}$, one in which every edge has been replaced by uncountably many parallel edges; and (ii) $G$ has no $K_{\aleph_0}$ subgraph. We show that the second condition is unnecessary.
DOI : 10.37236/6070
Classification : 05C05, 05C63, 05C75, 05C83
Mots-clés : infinite graph, normal spanning tree

Reinhard Diestel  1

1 Mathematisches Seminar, Hamburg University Germany 
@article{10_37236_6070,
     author = {Reinhard Diestel},
     title = {A simple existence criterion for normal spanning trees},
     journal = {The electronic journal of combinatorics},
     year = {2016},
     volume = {23},
     number = {2},
     doi = {10.37236/6070},
     zbl = {1336.05030},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6070/}
}
TY  - JOUR
AU  - Reinhard Diestel
TI  - A simple existence criterion for normal spanning trees
JO  - The electronic journal of combinatorics
PY  - 2016
VL  - 23
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6070/
DO  - 10.37236/6070
ID  - 10_37236_6070
ER  - 
%0 Journal Article
%A Reinhard Diestel
%T A simple existence criterion for normal spanning trees
%J The electronic journal of combinatorics
%D 2016
%V 23
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/6070/
%R 10.37236/6070
%F 10_37236_6070
Reinhard Diestel. A simple existence criterion for normal spanning trees. The electronic journal of combinatorics, Tome 23 (2016) no. 2. doi: 10.37236/6070

Cité par Sources :