paper

Confirmation of the Daykin-Frankl Conjecture

arXiv:2609.03087

Abstract

In 1983, Daykin and Frankl conjectured that if is a convex subset of , then it contains at least pairwise incomparable elements. We verify and communicate an LLM-generated proof of this conjecture.