Trivial-critical-parameter conjecture for graphs with
Let be a fixed graph, and let denote its Bernoulli percolation critical parameter. Assume , and let and be the frog-model critical parameters. Trivial-critical-parameter conjecture. For every , one has and . The source gives no resolution.
References
- Omer Angel, Daniel de la Riva, Jonathan Hermon and Yuliang Shi, “Existence and sharpness of the phase transition for the frog model on transitive graphs”, arXiv:2512.06640 (2026).
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.