Erdos-Ko-Rado Theorem
CombinatoricsSOLVED
Year
1961
Difficulty
*****
Solved by
Paul Erdos, Chao Ko & Richard Rado (1961)
Statement
Maximum size of an intersecting family of r-element subsets of an n-element set.
About this Problem
A cornerstone of extremal set theory with deep applications in coding theory and computer science.
About the Lean 4 Prover
Lean 4 is a theorem prover and programming language. When a proof compiles in Lean, it is mathematically certain to be correct — the type checker verifies every logical step. This is the gold standard for formal verification.
Our platform uses fal.ai serverless compute to run Lean verification, and Gemini to generate proof strategies that are then formally checked. ShinkaEvolve provides the evolutionary backbone for automated mathematical discovery.
Mathematical Art
Generate a unique AI illustration of this problem using fal.ai FLUX.