Quickly proving Diestel's normal spanning tree criterion
Combinatorics
2020-06-05 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2006.02994,
title = {Quickly proving Diestel's normal spanning tree criterion},
author = {Max Pitz},
journal= {arXiv preprint arXiv:2006.02994},
year = {2020}
}
Comments
4 pages