Erdős #712 · graph theory / turan number
Determine, for any , the value of
where is the largest number of -edges which can placed on vertices so that there exists no set…
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Determine, for any , the value of
where is the largest number of -edges which can placed on vertices so that there exists no set of vertices which is covered by all possible -edges.
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Turán proved that, when , this limit is
Erdős [Er81] offered $500 for the determination of this value for any fixed , and $1000 for 'clearing up the whole set of problems'.
See also [500] for the case and .
Progress & source assessment
The source labels this entry OPEN in the 2026-09-08 snapshot. Editorial progress notes are reproduced as source commentary, not independently verified results. Prize amounts and Lean badges at the source are not local awards or verification.
- [1]Thomas Bloom (ed.), Erdős Problems #712 link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.