Indexed metadata
Confirmation of the Daykin-Frankl Conjecture
Kada Williams
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.