ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k∈Nk\in\mathbb{N}, and let GG be a graph. For a vertex x∈V(G)x\in V(G), let N(x)N(x) denote its neighbourhood and let N2(x)N_2(x) denote its second neighbourhood. Large first- and second-neighbourhood conjecture. If

δ(G)≥k2\delta(G)\geq \frac{k}{2}

and there is a vertex xx such that

min⁡{∣N(x)∣,∣N2(x)∣}≥4k3,\min\{|N(x)|,|N_2(x)|\}\geq \frac{4k}{3},

then GG contains every tree with kk edges.

This offers a local alternative to imposing a large maximum degree, by requiring both the first and second neighbourhoods of one vertex to be large. The source presents it as an open approach to avoiding known extremal obstructions; no resolution is supplied.

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.