![](/files/happy5.png)
binary tree
Characterizing (aleph_0,aleph_1)-graphs ★★★
Call a graph an -graph if it has a bipartition
so that every vertex in
has degree
and every vertex in
has degree
.
Problem Characterize the
-graphs.
![$ (\aleph_0,\aleph_1) $](/files/tex/4170402299493c216234845dcc59a455da96e488.png)
Keywords: binary tree; infinite graph; normal spanning tree; set theory
![Syndicate content Syndicate content](/misc/feed.png)