A simple existence criterion for normal spanning trees in infinite graphs

Details A simple existence criterion for normal spanning trees in infinite graphs A simple existence criterion for normal spanning trees in infinite graphs

2012-02-20

arxiv.org/abs/1202.4399v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A simple existence criterion for normal spanning trees in infinite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A simple existence criterion for normal spanning trees in infinite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A simple existence criterion for normal spanning trees in infinite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-565593