PreprintCC BY 4.0arXiv
Confirmation of the Daykin-Frankl Conjecture
Abstract
In 1983, Daykin and Frankl conjectured that if P is a convex subset of Qn, then it contains at least |P|binomn⌊ n/2⌋2−n pairwise incomparable elements. We verify and communicate an LLM-generated proof of this conjecture.
Related
- The asymptotic Erd{ő}s--Frankl--Füredi cover-free conjecture
- A proof of the strong Erdős--Frankl--Füredi cover-free conjecture
- On the Frankl--Tokushige conjecture and almost complete r-cross t-intersection theorems for vector spaces
- Intersecting families with large covering number - On a conjecture of Frankl, Ota, and Tokushige
- Stability and exact extremal colourings for the Alon--Frankl--Lovász bound
BibTeX
@misc{williams2026confirmation,
title = {{Confirmation of the Daykin-Frankl Conjecture}},
author = {Kada Williams},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.03087},
eprint = {2609.03087},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.03087},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Confirmation of the Daykin-Frankl Conjecture
AU - Kada Williams
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2609.03087
UR - https://arxiv.org/abs/2609.03087
AB - In 1983, Daykin and Frankl conjectured that if P is a convex subset of Q_n, then it contains at least |P|binomn⌊ n/2⌋2^−n pairwise incomparable elements. We verify and communicate an LLM-generated proof of this conjecture.
ER -