ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Call a graph an (ℵ0,ℵ1)(\aleph_0,\aleph_1)-graph if it has a bipartition (A,B)(A,B) so that every vertex in AA has degree ℵ0\aleph_0 and every vertex in BB has degree ℵ1\aleph_1.

Problem Characterize the (ℵ0,ℵ1)(\aleph_0,\aleph_1)-graphs.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.