A 54-point construction for the Erdős–Szemerédi three-sunflower-free capacity

Robert F. Tilley Jr. presents a 54-point construction developed, with AI assistance, in G-14’s in-house computational research on sunflower-free families. It adds 12,723,600 sets at the join of two previously known blocks. A Lean 4 proof shows that the gain persists under iteration, raising the lower bound for the Erdős–Szemerédi three-sunflower-free capacity to 1.56786638820497592522…. The construction extends the join of two copies of Koshta’s 28-point block. Its exact rate is (7211663100 + √50588282321810251776)1/52. The accompanying Lean 4 proof covers the finite construction, the gluing argument, and the passage to the unrestricted capacity. The deposit includes the preprint, a replayable Lean proof, a finite arithmetic certificate and citation metadata. Problem 49a and its recorded bounds.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-20
DOI
https://doi.org/10.5281/zenodo.24405228
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A 54-point construction for the Erdős–Szemerédi three-sunflower-free capacity

Robert Tilley Jr.
3 links
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

A 54-point construction for the Erdős–Szemerédi three-sunflower-free capacity

Robert Tilley Jr.
preprint en

Abstract

Robert F. Tilley Jr. presents a 54-point construction developed, with AI assistance, in G-14’s in-house computational research on sunflower-free families. It adds 12,723,600 sets at the join of two previously known blocks. A Lean 4 proof shows that the gain persists under iteration, raising the lower bound for the Erdős–Szemerédi three-sunflower-free capacity to 1.56786638820497592522…. The construction extends the join of two copies of Koshta’s 28-point block. Its exact rate is (7211663100 + √50588282321810251776)1/52. The accompanying Lean 4 proof covers the finite construction, the gluing argument, and the passage to the unrestricted capacity. The deposit includes the preprint, a replayable Lean proof, a finite arithmetic certificate and citation metadata. Problem 49a and its recorded bounds.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon