ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let ind(G){\rm ind}(G) be its number of independent sets, let d(u)d(u) be the degree of uu, let iso(G){\rm iso}(G) be the number of isolated vertices, and define

Π(G)=2iso(G)∏uv∈E(G)(2d(u)+2d(v)−1)1d(u)d(v).\Pi(G)=2^{{\rm iso}(G)}\prod_{uv\in E(G)}\left(2^{d(u)}+2^{d(v)}-1\right)^\frac{1}{d(u)d(v)}.

A vertex x∈V(G)x\in V(G) is good for GG if

Π(G)≥Π(G−x)+Π(G−x−N(x)),\Pi(G)\geq \Pi(G-x)+\Pi(G-x-N(x)),

where N(x)N(x) is the set of neighbours of xx. Good-vertex conjecture. For every graph GG with at least one vertex, there is a vertex x∈V(G)x\in V(G) that is good for GG. This conjecture would imply Kahn's independent-set bound.

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.