ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an nn-vertex graph, and let z(G;k)z(G;k) denote the number of zero forcing sets of GG having size kk. Let PnP_n be the path on nn vertices. Fixed-size zero forcing conjecture. If GG is an nn-vertex graph, then for all kk,

z(G;k)≤z(Pn;k)=(nk)−(n−k−1k).z(G;k)\le z(P_n;k)=\binom{n}{k}-\binom{n-k-1}{k}.

This conjecture would imply the path extremal conjecture for the probability that a random vertex set is zero forcing, via the expansion of that probability in terms of the numbers z(G;k)z(G;k). The paper presents it as a stronger conjecture and does not establish it.

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.