ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Besomi–Pavez-Signé–Stein conjecture. If

δ(G)≥(1+α)k2\delta(G)\geq (1+\alpha)\frac{k}{2}

and

Δ(G)≥2(1−α)k,\Delta(G)\geq 2(1-\alpha)k,

then GG contains every tree with kk edges.

The conjecture combines minimum- and maximum-degree hypotheses to force the containment of every kk-edge tree. The source reports partial progress, including a relaxation of the α=0\alpha=0 case, but does not state that the conjecture itself has been resolved.

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.