Alon and Wei's bounded repeated-degree conjecture
Statement
Let be a graph on vertices with minimum degree . For a graph , let denote the maximum number of vertices having the same degree in . Bounded repeated-degree conjecture. contains a spanning subgraph satisfying
This is the second conjecture on spanning irregular subgraphs in the paper. The authors state that it remains open and establish asymptotic and universal weaker bounds.
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.