Prove CriticalPercolation (openai/math family 213: No infinite critical clusters on quasi-transitive graphs)…
Prove CriticalPercolation (openai/math family 213: No infinite critical clusters on quasi-transitive graphs)…: a task in openai/math as Harbor environments (Harbor dataset). Context: this statement belongs to family 213 of the release, No infinite critical clusters on quasi-transitive graphs…
The task
Context: this statement belongs to family 213 of the release, *No infinite critical clusters on quasi-transitive graphs* (Probability and statistical mechanics). The family as a whole: Resolves the Benjamini–Schramm criticality conjecture for bond percolation on every infinite connected locally finite…
Part of raising-heart/openai-math.