ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ka,bK_{a,b} be a bidirectional complete bipartite graph with all edges of equal weight, where a>ba>b. Let AA and BB be its partite sets, with ∣A∣=a|A|=a and ∣B∣=b|B|=b. For vertices u∈Au\in A and v∈Bv\in B, write eptrzf⁡(Ka,b,x)\operatorname{ept_{rzf}}(K_{a,b},\\{x\\}) for the expected randomized zero-forcing propagation time when xx is the initial blue vertex. Initial-vertex conjecture.

eptrzf⁡(Ka,b,v)<eptrzf⁡(Ka,b,u).\operatorname{ept_{rzf}}(K_{a,b},\\{v\\})<\operatorname{ept_{rzf}}(K_{a,b},\\{u\\}).

This claims that, when the two partite sets have unequal sizes, starting in the smaller part gives strictly smaller expected propagation time than starting in the larger part. The surrounding results establish order-of-growth bounds for complete bipartite graphs, but do not resolve this strict comparison.

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.