The two-round minimal percolating set conjecture

Let Πq\Pi_q be a finite projective plane of order qq, let rr be the infection rate, and let tr(A)t_r(A) denote the percolation time of a percolating set AA. Two-round minimal percolating set conjecture. For each rr with

4rq,4\leq r\leq q,

there exists a minimal percolating set ArA_r with

tr(Ar)=2.t_r(A_r)=2.

This asserts the existence of minimal percolating configurations that infect the entire plane in exactly two rounds throughout the stated range. The source gives a construction and proof around the conjecture, but the supplied parser status is unresolved.

Sources & referencesView supporting material

Primary source

Dániel Gerbner, Balázs Keszegh, Gábor Mészáros, Balázs Patkós and Máté Vizer, “Line Percolation in Finite Projective Planes”, arXiv:1608.00531 (2016).

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.