Erdős #1075 · hypergraphs
Let . There exists such that, for any , if is sufficiently large, the following holds.
Any -uniform hypergraph on vertices with at least many edges cont…
Problem statement
Let . There exists such that, for any , if is sufficiently large, the following holds.
Any -uniform hypergraph on vertices with at least many edges contains a subgraph on vertices with at least edges, where as .
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Erdős [Er64f] proved that this is true with whenever the graph has at least many edges.
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 #1075 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.