Diestel, Reinhard
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.
Keywords: binary tree; infinite graph; normal spanning tree; set theory