Partite-set comparison conjecture for expected propagation times of complete bipartite graphs
Let have partite vertex sets and of orders and respectively, and let and . Partite-set comparison conjecture. If and , then
The conjecture asserts that, except for the noted small outlier, starting from a vertex in the larger partite set gives a smaller expected propagation time. Its status is not established in the supplied material.
References
- Yu Chan, Emelie Curl, Jesse Geneson, Leslie Hogben, Kevin Liu, Issac Odegard and Michael S. Ross, “Using Markov chains to determine expected propagation time for probabilistic zero forcing”, arXiv:1906.11083 (2019).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.