Maximum Size of a Family of Pairwise Graph-Different Permutations

Louis Golowich, Chiheon Kim, Richard Zhou

Two permutations of the vertices of a graph $G$ are called $G$-different if there exists an index $i$ such that $i$-th entry of the two permutations form an edge in $G$. We bound o…