Abstract
A set F of ordered k-tuples of distinct elements of an n-set is pairwise reverse free if it does not contain two ordered k-tuples with the same pair of elements in the same pair of coordinates in reverse order. Let F(n,k) be the maximum size of a pairwise reverse-free set.
In this paper we focus on the case of 3-tuples and determine the asymptotic behavior of F(n,3), and provide an exact formula for F(n,3) whenever n is a power of 3. We also present results for general k, and for certain related functions as well.