An internal partition of a graph is a partition into two nonempty parts in which every vertex has at least as many neighbors in its own part as in the other.
Statement
An internal partition of a graph is a partition into two nonempty parts in which every vertex has at least as many neighbors in its own part as in the other. Is it true that, for every d, only finitely many d-regular graphs have no internal partition?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.