On isomorphic subgraphs (Q685560)

This note is concerned with a question on the maximum possible \(s\) such that an arbitrary graph or hypergraph \(G\) contains a pair of edge disjoint isomorphic subgraphs of size \(s\). The authors investigate this question in the case of 3-uniform hypergraphs. Namely, it is proved that a 3-uniform hypergraph \(G\) of size \(q\) contains two edge disjoint isomorphic subgraphs of size at last \(\bigl\lfloor {1 \over 23}\sqrt q \bigr\rfloor\). They conclude with a conjecture that a \(k\)-uniform hypergraph of size \(q\) contains two isomorphic subgraphs of size \(cq^{2/(k+1)}\).