Skip to main content
SpringerLink
Log in

Partially ordered sets and k-decomposability

  • 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. S. S. Kisiitsyn, On Maximal k-Decomposable Sets of Permutations of Degree n [in Russian], Sib. Matem. Zh.,7, No. 4, 826–831 (1966).

    MathSciNet  Google Scholar 

Download references

Authors
  1. S. S. Kislitsym
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 8, No. 5, pp. 1197–1201, September–October, 1967.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kislitsym, S.S. Partially ordered sets and k-decomposability. Sib Math J 8, 916–919 (1967). https://doi.org/10.1007/BF01040665

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation