The initial-vertex conjecture for randomized zero forcing on complete bipartite graphs
Statement
Let be a bidirectional complete bipartite graph with all edges of equal weight, where . Let and be its partite sets, with and . For vertices and , write for the expected randomized zero-forcing propagation time when is the initial blue vertex. Initial-vertex conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.