Title of article :
Complete Intersection Problems for Finite Permutations
Author/Authors :
Blinovsky، نويسنده , , Vladimir، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2011
Abstract :
We find the maximal number of permutations on a set of n elements such that any pair of permutations has at least t common cycles.
Keywords :
Complete intersection theorem , Permutations
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics