Enomoto and Ota's path-partition conjecture
Statement
Let be a graph of order , let be an integer, and let be positive integers satisfying
Write for the minimum degree sum of two nonadjacent vertices. Enomoto and Ota's conjecture. If
then for any distinct vertices in , there exist vertex-disjoint paths such that and starts at for every . The conjecture predicts a prescribed path partition of the entire vertex set under a degree-sum condition; the paper proves it when the order of is sufficiently large, while the remaining cases are not addressed 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.