What was already known
Alon and Peres conjectured a bound uniform over graphs with minimum degree at least three. Bencs and collaborators obtain a related bound with an additional logarithmic factor in greater generality and no such factor for fixed-degree expanders.
AI involvement
GPT-5.6 Sol Ultra proved the degree-three case and supplied the key plans and excursion-reversal arguments. Dozier generalized the proof to fixed degrees , worked through corner cases and wrote the manuscript. Codex formalized the resulting theorem.
- The Birthday Paradox for non-backtracking walks on regular graphsThe Birthday Paradox for non-backtracking walks on regular graphs
Importance
The theorem establishes the conjectured square-root collision scale for all regular graphs of each fixed degree at least three.
Technical verification
Dozier reports a complete Lean proof of Theorem 1.1. The pinned Solution proves birthday_paradox and the formalization manifest reports the three standard axioms for the checked statement.
Formal checking
Dozier reports a complete Lean proof of Theorem 1.1. The pinned Solution proves birthday_paradox and the formalization manifest reports the three standard axioms for the checked statement.
- Checker
- Benjamin Dozier, reporting Lean 4 verification
- Scope
- Dozier reports a complete Lean proof of Theorem 1.1. The pinned Solution proves birthday_paradox and the formalization manifest reports the three standard axioms for the checked statement.
- Basis
- Reported by the linked checker
- Pinned theorem, provenance and checking recordPinned theorem, provenance and checking record
Human understanding
Dozier explains the planned-walk encoding, why many deviations return quickly and how reversing excursions forces intersections. He used this argument in the human generalization from degree three.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision