Characterizing (aleph_0,aleph_1)-graphs
Statement
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.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.