The Daykin–Frankl conjecture on convex subsets of the Boolean lattice
Statement
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.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.