Source authenticated

Lower bound 0.380554700.38055470 for Erdős's minimum overlap constant

A rigorous lower bound c>0.38055470c > 0.38055470, improving White's 0.3790050.379005 (2022). The problem stays open: the best public upper bound is 0.38085857490.3808585749 (Einstein Arena, August 2026; 0.3808680.380868 in the literature, SimpleTES), so cc is now known to within about 3×10−43 \times 10^{-4}. The bound rests on a finite certificate checked in ball arithmetic plus a step-function transfer from the continuous to the finite problem. The later Station paper (arXiv 2608.23691) reaches 0.3805520.380552, below this; a higher claim of 0.38056340.3805634 posted to the tracker on 19 September is unchecked.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Jun 29, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: site-confirmed. Publication: announcement. AI contribution: ai-co-developed. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

Canonical aliases: Lower bound $0.38055470$ for Erdős's minimum overlap constant · Minimum overlap lower bound · Problem 36

Confidence: Not scored

Registry verification: site confirmed · announcement · partial

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

GPT Pro (version not stated)
model · ai model contributor · OpenAI

Liam Price
human · human collaborator

Lineage and corrections

Lower bound 0.380554700.38055470 for Erdős's minimum overlap constant parent of this event

VibeMathed record: Lower bound 0.380554700.38055470 for Erdős's minimum overlap constant evidence for this event

Lower bound 0.380554700.38055470 for Erdős's minimum overlap constant evidence for this event

Bounds table, teorth/optimizationproblems (constant 1b) evidence for this event

This event attributed to Liam Price

Station paper, a later and lower AI-assisted bound (0.380552) evidence for this event

erdosproblems.com #36 thread (author's announcement) evidence for this event

This event attributed to GPT Pro (version not stated)

A rigorous lower bound c>0.38055470c > 0.38055470, improving White's 0.3790050.379005 (2022). The problem stays open: the best public upper bound is 0.38085857490.3808585749 (Einstein Arena, August 2026; 0.3808680.380868 in the literature, SimpleTES), so cc is now known to within about 3×10−43 \times 10^{-4}. The bound rests on a finite certificate checked in ball arithmetic plus a step-function transfer from the continuous to the finite problem. The later Station paper (arXiv 2608.23691) reaches 0.3805520.380552, below this; a higher claim of 0.38056340.3805634 posted to the tracker on 19 September is unchecked. parent of this event

erdosproblems.com problem 36 evidence for this event

Act on this frontier

Verify, challenge, or extend the result.