ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For every finite simple connected graph G=(V,E)G=(V,E), let NG(v)N_G(v) denote the neighborhood of vv, let α(G[NG(v)])\alpha(G[N_G(v)]) be the independence number of the subgraph induced by NG(v)N_G(v), and define the average local independence by AvgInd⁡(G)=1∣V∣∑v∈Vα(G[NG(v)])\operatorname{AvgInd}(G)=\frac{1}{|V|}\sum_{v\in V}\alpha(G[N_G(v)]). Let Ls(G)L_s(G) be the maximum number of leaves in a spanning tree of GG. Then 2(AvgInd⁡(G)−1)≤Ls(G)2\bigl(\operatorname{AvgInd}(G)-1\bigr)\le L_s(G); equivalently, in the formalized notation, 2(G.averageIndepNeighbors⁡−1)≤G.Ls2\bigl(G.\operatorname{averageIndepNeighbors}-1\bigr)\le G.Ls.

Record

Added
Links

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.