Quickly Proving Diestel's Normal Spanning Tree Criterion

  • Max Pitz
DOI: https://doi.org/10.37236/9619

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.

Published
2021-09-24
How to Cite
Pitz, M. (2021). Quickly Proving Diestel’s Normal Spanning Tree Criterion. The Electronic Journal of Combinatorics, 28(3), P3.59. https://doi.org/10.37236/9619
Issue
Volume 28, Issue 3 (2021)
Article Number
P3.59