Rao–Rao k-factor conjecture for graphic degree sequences
Statement
Let be a graphic degree sequence, and let denote the degree sequence in which every term is . Two graphic degree sequences pack when they have realizations on the same vertex set with edge-disjoint edge sets. Rao–Rao -factor conjecture. Graphic degree sequences and pack if and only if is graphic. This generalizes Grünbaum's conjecture for the all-ones sequence and asks when the necessary condition that the componentwise sum be graphic is also sufficient; the source provides no resolution status.
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.