Erdős #719 · graph theory / hypergraphs
Let be the maximum number of -edges that can be placed on vertices without forming a (the -uniform complete graph on vertices).
Is every -hypergraph on …
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Let be the maximum number of -edges that can be placed on vertices without forming a (the -uniform complete graph on vertices).
Is every -hypergraph on vertices the union of at most many copies of and , no two of which share a ?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
A conjecture of Erdős and Sauer.
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 #719 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.