No two-round minimal line-percolating set in PG(2,5): a counterexample to Conjecture 20 of Gerbner-Keszegh-Meszaros-Patkos-Vizer (arXiv:1608.00531)
Abstract
Conjecture 20 fails at the allowed boundary (q,r) = (5,5): in PG(2,5) no inclusion-minimal percolating set has percolation time 2 at threshold 5.
AI-assisted research preprint. The scoped main statement has a Lean certificate. Internal AI review is not external journal peer review; bounded prior-art searches do not certify worldwide priority. See the paper for exact qualifications and formalization limits.
Supplementary files
Comments
Submitted by Myeongjin Kang. Related MathDB problem 333709. Download all three proof-sources-part-01.json through proof-sources-part-03.json attachments and extract_sources.py together. Run the extractor to reconstruct all 848 archived files (tar+xz+base64 encoding). All extracted file bytes were compared with the accepted original archive. Original archive SHA-256: b2e78af5a5191a37f364f39a89272af5898ca6a7ecc59058a7661649837ea9fb.