Skip to main content
SpringerLink
Log in

Maximal k-decomposable sets of permutations of degree n

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. L. R. Ford and S. R. Johnson, A tournament problem, Amer. Math. Monthly,66, No. 5, 387–389 (1959).

    Google Scholar 

  2. S. S. Kislitsyn, Bounds on the least average number of pairwise comparisons necessary for complete ordering of N objects of different weight [in Russian], Vestnik Leningr. gos. un-ta,1, No. 1, 162–163 (1962).

    Google Scholar 

  3. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley (1950).

Download references

Authors
  1. S. S. Kislitsyn
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 7, No. 4, pp. 826–831, July–August, 1966.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kislitsyn, S.S. Maximal k-decomposable sets of permutations of degree n. Sib Math J 7, 658–662 (1966). https://doi.org/10.1007/BF00973263

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00973263

Search

Navigation