ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an (n+1)(n+1)-vertex graph GG and a vertex v∈V(G)v\in V(G), write G∖{v}G\setminus\{v\} for the graph obtained by deleting vv, and define

f(n)=max⁡{r(G)r(G∖{v}):G is an (n+1)-vertex graph and v∈V(G)}.f(n)=\max\left\{\frac{r(G)}{r(G\setminus\{v\})}:G\text{ is an }(n+1)\text{-vertex graph and }v\in V(G)\right\}.

Polynomial sensitivity conjecture. There is some c>0c>0 such that f(n)≥ncf(n)\geq n^c for all sufficiently large nn.

The preceding bounds give Ω(log⁡n)≤f(n)≤O(nlog⁡n)\Omega(\log n)\leq f(n)\leq O(\sqrt{n\log n}), so the conjecture asks for a polynomial lower bound on the effect of deleting one vertex.

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.