Skip to main content
Log in

On a certain complexity estimate in graph theory

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

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. S. V. Sudoplatov, “On basedness in planar-predicate theories and theories without, semicontours,” submitted to VINITI on January 15, 1991, No. 245-V91.

  2. Handbook on Mathematical Logic. Vol. 1: Model Theory [Russian translation], Nauka, Moscow (1982).

  3. F. Harary, Graph Theory [Russian translation], Mir, Moscow (1973).

    Google Scholar 

  4. H. Herre, A. H. Mekler, and K. W. Smith, “Superstable graphs,” Fund. Math.,118, No. 2, 75–79 (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The research was supported by the Russian Foundation for Basic Research (Grant 93-01-01520) and the American Mathematical Society.

Translated fromSibirskii Matematicheskii Zhurnal, Vol. 37, No. 3, pp. 700–703, May–June, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sudoplatov, S.V. On a certain complexity estimate in graph theory. Sib Math J 37, 614–617 (1996). https://doi.org/10.1007/BF02104862

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation