ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k∈Nk\in\mathbb{N}, and let GG be a graph. Write δ(G)\delta(G) and Δ(G)\Delta(G) for its minimum and maximum degrees, respectively.

Havet–Reed–Stein–Wood conjecture. If

δ(G)≥⌊2k3⌋\delta(G)\geq \left\lfloor\frac{2k}{3}\right\rfloor

and

Δ(G)≥k,\Delta(G)\geq k,

then every tree with kk edges is a subgraph of GG.

This conjecture proposes a sharper maximum-degree condition at the endpoint corresponding to α=1/3\alpha=1/3 of the preceding conjecture. The source presents it as open and records counterexamples showing that related weaker minimum-degree conditions can require substantially larger maximum degree.

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.