Borozan et al.'s conjecture on k-proper partitions
Statement
Let be a graph of order , and let be an integer at least . A partition of is -proper if every part induces a -connected subgraph of , where a graph is -connected if it has more than vertices and deleting any set of fewer than vertices leaves it connected. Write for the minimum degree of . Borozan et al.'s conjecture. If
then has a -proper partition satisfying
This would improve the known bound with constant in the corresponding minimum-degree theorem, reducing that constant to and sharpening the bound on the number of parts.
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.