ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, and let Tn{\mathcal T}_n denote the family of spanning trees on these vertices. In the Maker–Breaker game (E(Kn),Tn)(E(K_n),{\mathcal T}_n), Maker claims edges while Breaker claims the remaining edges; write Δ(T)\Delta(T) for the maximum degree of a tree TT. Maker's bounded-degree tree-building conjecture. For every positive integer Δ\Delta, there exists an integer n0=n0(Δ)n_0=n_0(\Delta) such that, for every n≥n0n\geq n_0 and every tree T=(V,E)T=(V,E) with ∣V∣=n|V|=n and Δ(T)≤Δ\Delta(T)\leq\Delta, Maker has a strategy to win the game (E(Kn),Tn)(E(K_n),{\mathcal T}_n) within nn moves. The conjecture asserts that every sufficiently large bounded-degree tree can be built with at most one wasted move beyond the theoretical minimum of n−1n-1 moves; the paper establishes this bound for trees with a long bare path and an n+1n+1-move bound in general, leaving the stated uniform nn-move bound open.

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.