Remark on one problem in extremal combinatorics |
| |
| Authors: | V M Blinovsky |
| |
| Affiliation: | 1.Kharkevich Institute for Information Transmission Problems,Russian Academy of Sciences,Moscow,Russia |
| |
| Abstract: | We reduce the problem of determining the maximum number of permutations of a finite set such that any pair of permutations
has at least t common transpositions to the problem of determining the maximum number of permutations of finite set such that any pair has
at least t common fixed points. The latter problem was solved by the author in 1]. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
