Normal spanning trees exist in a connectoid precisely when its ground set admits a well-ordering of countable separation number, via an extension of Jung's dispersed-sets characterization.
Diestel,Normal tree orders for infinite graphs, Transactions of the American Mathematical Society 345 (1994), no
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Connectoids II: existence of normal trees
Normal spanning trees exist in a connectoid precisely when its ground set admits a well-ordering of countable separation number, via an extension of Jung's dispersed-sets characterization.