ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd-regular graphs be graphs in which every vertex has degree dd, and call a partition of the vertex set into two parts an internal partition when every vertex has at least as many neighbors in its own part as in the other part. Ban and Linial's conjecture. For every dd there are only finitely many dd-regular graphs with no internal partitions. The conjecture proposes that graphs lacking internal partitions are exceptional within each fixed regularity degree; the source gives no resolution here.

Record

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.