The critical one-half conjecture for circle packings
The critical one-half conjecture for circle packings
Let be a circle packing and let . For , let denote the event that is connected to distance by open disks, and let denote the event that it is connected to infinity. The critical one-half conjecture for circle packings.
This would imply absence of infinite components at for several classes of planar graphs, including recurrent simple plane triangulations and suitable Benjamini–Schramm limits. It remains open even for triangulation circle packings with carrier and uniformly bounded disk radii.
Sources & referencesView supporting material
Primary source
Ron Peled, “On the site percolation threshold of circle packings and planar graphs”, arXiv:2001.10855 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.