Maximal k-decomposible sets of permutations of degree n

DOI10.1007/BF00973263zbMath0161.01201OpenAlexW2085106067MaRDI QIDQ2528670

S. S. Kislitsyn

Publication date: 1966

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00973263

zbMATH Keywords

combinatorics

Related Items

Problem in combinatorial analysis ⋮ Finite partially ordered sets and their corresponding permutation sets

Cites Work

• Unnamed Item
• A Tournament Problem