Skip to main content
SpringerLink
Log in

A graph coloring problem

  • Short Communications
  • Published:
Mathematical Notes 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

References

  1. R. M. Fedorov, A. Ya Kannel’-Belov, A. K. Koval’dzhi, and I. V. Yashchenko, 1993–2005 Moscow Mathematical Contests (MTsNMO, Moscow, 2008) [in Russian].

    Google Scholar 

  2. N. Alon and J. H. Spencer, The Probabilistic Method (Wiley, New York, 2004; BINOM, Moscow, 2007).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Razumovskii Moscow State University of Technologies and Management, Moscow, Russia

    Yu. A. Zuev

Authors
  1. Yu. A. Zuev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. A. Zuev.

Additional information

Original Russian Text © Yu. A. Zuev, 2015, published in Matematicheskie Zametki, 2015, Vol. 97, No. 6, pp. 942–944.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zuev, Y.A. A graph coloring problem. Math Notes 97, 965–967 (2015). https://doi.org/10.1134/S0001434615050338

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0001434615050338

Keywords

Search

Navigation