Some intersection theorems for ordered sets and graphs
Journal of Combinatorial Theory Series A
On the Sperner Capacity of the Cyclic Triangle
Journal of Algebraic Combinatorics: An International Journal
The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle
Journal of Algebraic Combinatorics: An International Journal
On the extremal combinatorics of the Hamming space
Journal of Combinatorial Theory Series A
The maximum size of 3-uniform hypergraphs not containing a fano plane
Journal of Combinatorial Theory Series B
Triple Systems Not Containing a Fano Configuration
Combinatorics, Probability and Computing
Disjoint representability of sets and their complements
Journal of Combinatorial Theory Series B
Pairwise colliding permutations and the capacity of infinite graphs
SIAM Journal on Discrete Mathematics
Small Forbidden Configurations IV: The 3 Rowed Case
Combinatorica
The Turán Number Of The Fano Plane
Combinatorica
Unavoidable Traces Of Set Systems
Combinatorica
On A Hypergraph Turán Problem Of Frankl
Combinatorica
Note: l-trace k-Sperner families of sets
Journal of Combinatorial Theory Series A
Permutation Capacities of Families of Oriented Infinite Paths
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
A set $\mathcal{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 prove $\lim F(n,3)/\binom{n}{3}=5/4$, more exactly, $\frac{5}{24}n^3-\frac{1}{2}n^2-O(n\log n)