ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥3d\geq 3 be an integer and let GG be a connected graph of order n≥d+1n\geq d+1. For S⊆V(G)S\subseteq V(G), let i(G−S)i(G-S) denote the number of isolated vertices in G−SG-S. Kaneko's conjecture. If

i(G−S)<2∣S∣d−2i(G-S)<\frac{2|S|}{d-2}

for every nonempty subset S⊆V(G)S\subseteq V(G), then GG has a spanning tree with leaf distance at least dd. The conjecture refines the known characterization for spanning trees of bounded leaf degree: decreasing the coefficient of ∣S∣|S| 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.