Skip to main content
SpringerLink
Log in

An upper bound for theα-height of (0, 1)-matrices

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

Abstract

We obtain an upper bound for theα-height of an arbitrary matrix of zeros and ones. We apply the result to a number of known combinatorial problems.

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

Similar content being viewed by others

Literature cited

  1. A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Moscow (1969).

  2. é. I. Nechiporuk, “On the complexity of gating schemes realizing Boolean matrices with undefined elements,” Dokl. Akad. Nauk SSSR,163, No. 1, 40–43 (1965).

    Google Scholar 

  3. A. O. Gel'fond, “On some combinatorial properties of (0, l)-matriees,” Matem. Sb.,75 (117), No. 1, 3 (1968).

    Google Scholar 

  4. V. E. Tarakanov, “On the maximum height of a class of (0, l)-matrices,” Matem. Sb.,75 (117), No. 1, 4–14 (1968).

    Google Scholar 

  5. D. R. Fulkerson and H. J. Ryser, “Width sequences for special classes of (0, l)-matrices,” Canad. J. Math.,15, No. 3, 371–396 (1963).

    Google Scholar 

  6. D. R. Fulkerson and H. J. Ryser, “Widths and heights of (0, l)-matrices,” Canad. J. Math.,13, No. 2, 239–255 (1961).

    Google Scholar 

  7. C. Berge, Theory of Graphs, Methuen, London (1962).

    Google Scholar 

  8. H. J. Ryser, Combinatorial Mathematics, Wiley, New York (1963).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Siberian Branch of the Academy of Sciences of the USSR, USSR

    V. K. Leont'ev

Authors
  1. V. K. Leont'ev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

By a (0, 1) matrix here we mean an arbitrary matrix whose elements are zeros and ones.

Translated from Matematicheskie Zametki, Vol. 15, No. 3, pp. 421–429, March, 1974.

In conclusion, the author expresses his thanks to A. A. Markov for a number of useful remarks made in the course of discussing this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Leont'ev, V.K. An upper bound for theα-height of (0, 1)-matrices. Mathematical Notes of the Academy of Sciences of the USSR 15, 245–250 (1974). https://doi.org/10.1007/BF01438378

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation