Combinatorics and Graph Theory

Making Derangements Using Element Swaps

Authors: Pranjal Jain
Comments: 16 Pages.

The aim of the article is to show that there always exists a sequence of swaps of elements, which when applied to a derangement (of n>3 elements) will go through all derangements of n elements, with an additional constraint that all swaps in this sequence produce a derangement (not necessarily one which hasn't appeared before in the sequence).
Category: Combinatorics and Graph Theory