Erdős Problem 643

### What is the conjecture

https://www.erdosproblems.com/643

Let $f(n;t)$ be minimal such that if a $t$-uniform hypergraph on $n$ vertices contains at least $f(n;t)$ edges then there must be four edges $A,B,C,D$ such that
$$A\cup B= C\cup D$$
and
$$A\cap B=C\cap D=\emptyset.$$
Estimate $f(n;t)$ - in particular, is it true that for $t\geq 3$
$$f(n;t)=(1+o(1))\binom{n}{t-1}?$$

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else