OpenFrontiers
← Back to the index

Erdős #1075 · hypergraphs

Let r≥3r\geq 3. There exists cr>r−rc_r>r^{-r} such that, for any ϵ>0\epsilon>0, if nn is sufficiently large, the following holds.

Any rr-uniform hypergraph on nn vertices with at least (1+ϵ)(n/r)r(1+\epsilon)(n/r)^r many edges cont…

Source reports OPENAs of 2026-09-08Source & evidence ↓

Problem statement

Let r≥3r\geq 3. There exists cr>r−rc_r>r^{-r} such that, for any ϵ>0\epsilon>0, if nn is sufficiently large, the following holds.

Any rr-uniform hypergraph on nn vertices with at least (1+ϵ)(n/r)r(1+\epsilon)(n/r)^r many edges contains a subgraph on mm vertices with at least crmrc_rm^r edges, where m=m(n)→∞m=m(n)\to \infty as n→∞n\to \infty.

Lean 4

Not yet attached

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 cr=r−rc_r=r^{-r} whenever the graph has at least ϵnr\epsilon n^r 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.

References
  1. [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 recorded

Attempts 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 notes

Notes 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.