Kaneko's spanning-tree leaf-distance conjecture
Statement
Let be an integer and let be a connected graph of order . For , let denote the number of isolated vertices in . Kaneko's conjecture. If
for every nonempty subset , then has a spanning tree with leaf distance at least . The conjecture refines the known characterization for spanning trees of bounded leaf degree: decreasing the coefficient of in the condition is expected to force a larger leaf distance. The case of leaf distance at least three follows from existing results, while the general assertion is posed as an open conjecture.
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.