A concentration bound for the longest increasing subsequence of a randomly chosen involution

In this short note we prove a concentration result for the length of the longest increasing subsequence (LIS) of a randomly and uniformly chosen involution of {1,…,s}{1,…,s}.