Robustness of Erd\H{o}s--Ko--Rado theorems on permutations and perfect
matchings
Robustness of Erd\H{o}s--Ko--Rado theorems on permutations and perfect
matchings
The Erd\H{o}s--Ko--Rado (EKR) theorem and its generalizations can be viewed as classifications of maximum independent sets in appropriately defined families of graphs, such as the Kneser graph $K(n,k)$. In this paper, we investigate the independence number of random spanning subraphs of two other families of graphs whose maximum independent sets …