Dual View Random Solved Random Open
OPEN This is open, and cannot be resolved with a finite computation.
Let $t,k,r\geq 2$. Let $\mathcal{F}$ be the family of all $r$-uniform hypergraphs with $k$ vertices and $s$ edges. Determine\[\mathrm{ex}_r(n,\mathcal{F}).\]
Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.
This is a very difficult and general question, and many partial results are known. The paper of Brown, Erdős, and Sós [BES73] contains many of them, in particular the general lower bound, for all $k>r$ and $s>1$,\[\mathrm{ex}_r(n,\mathcal{F})\gg_{k,s} n^{\frac{rs-k}{s-1}}.\]A general conjecture of Brown, Erdős, and Sós is that, for all $r>t\geq 2$ and $s\geq 3$,\[\mathrm{ex}_t(n,\mathcal{F})=o(n^t)\]whenever $k\geq (r-t)s+t+1$. The case $t=2$ is the subject of [1178].

The case $s=r=3$ and $k=6$ is the subject of [716]. The case of $r=3$ and $k=s+2$ is the subject of [1076].

View the LaTeX source

This page was last edited 24 January 2026.

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)
Related OEIS sequences: Possible
Likes this problem None
Interested in collaborating None
Currently working on this problem None
This problem looks difficult None
This problem looks tractable None
The results on this problem could be formalisable None
I am working on formalising the results on this problem None

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #1157, https://www.erdosproblems.com/1157, accessed 2026-03-01