Id: palomar/PALOMAR-2026-11-07-000001 Url: https://github.com/bocowgill/lennon-pittel/tree/74c5030bb54995035028e11ca8806890c2e9a6b7 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000001-v1.json Repo: https://github.com/bocowgill/lennon-pittel Tags: math.CO, math.PR, msc:05C70, msc:60C05 Score: 0 Title: The Lennon–Pittel conjecture on random stable matchings Trust: high Domain: math.CO Source: palomar Authors: Bo Cowgill Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-07 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-07-000001 We prove the Lennon–Pittel conjecture for balanced stable marriage with independent, uniform strict preferences. Let S_n count the stable complete matchings between two sides of size n. For every positive nonincreasing sequence epsilon_n tending to zero, the probability that S_n is at least epsilon_n times its expectation tends to one. This gives a lower-tail estimate at the scale of Pittel's first-moment asymptotic.