we show that any $k$-uniform hypergraph with $n$ edges contains two edge disjoint subgraphs of size $\tilde{\omega}(n^{2/(k+1)})$ for $k=4,5$ and $6$. this result is best possible up to a logarithmic factor due to a upper bound construction of erd\h{o}s, pach, and pyber who show there exist $k$-uniform hypergraphs with $n$ edges and with no two edge disjoint isomorphic subgraphs with size larger than $\tilde{o}(n^{2/(k+1)})$. furthermore, this result extends results erd\h{o}s, pach and pyber who also established the lower bound for $k=2$ (eg. for graphs), and of gould and r\"odl who established the result for