Open-access mathematical research insights
About Contact
Home / Erdos Problems / Problem #1075

Problem #1075: Let $r\geq 3$. There exists $c_r>r^{-r}$ such that, for any...

Let $r\geq 3$. There exists $c_r>r^{-r}$ such that, for any $\epsilon>0$, if $n$ is sufficiently large, the following holds.Any $r$-uniform...

Problem Statement

Let $r\geq 3$. There exists $c_r>r^{-r}$ such that, for any $\epsilon>0$, if $n$ is sufficiently large, the following holds.

Any $r$-uniform hypergraph on $n$ vertices with at least $(1+\epsilon)(n/r)^r$ many edges contains a subgraph on $m$ vertices with at least $c_rm^r$ edges, where $m=m(n)\to \infty$ as $n\to \infty$.
Categories: Hypergraphs

Progress

Erdős [Er64f] proved that this is true with $c_r=r^{-r}$ whenever the graph has at least $\epsilon n^r$ many edges.

Source: erdosproblems.com/1075 | Last verified: January 19, 2026

Stay Updated

Get weekly digests of new research insights delivered to your inbox.