Extremal problems concerning transformations of the edges of the complete hypergraphs

We consider extremal problems concerning transformations of the edges of complete hypergraphs. We estimate the order of the largest subhypergraph K such that for every edge e ? E(K), f(e) ? E(K), assuming f(e) ≠ e. Several extensions and variations of this problem are also discussed here.