Skip to main content
SpringerLink
Log in

On random subgraphs of Kneser graphs and their generalizations

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

A series of results are obtained on the stability of the independence number of random subgraphs of distance graphs, which are natural generalizations of the classical Kneser graphs.

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

References

  1. A. M. Raigorodskii, Contemp. Math. 625, 93–109 (2014).

    Article  MathSciNet  Google Scholar 

  2. A. M. Raigorodskii, in Thirty Essays on Geometric Graph Theory (Springer-Verlag, Berlin, 2013), pp. 429–460.

    Book  Google Scholar 

  3. Z. Nagy, Mat. Lapok 23, 301–302 (1972).

    MathSciNet  Google Scholar 

  4. P. Frankl and R. Wilson, Combinatorica 1, 357–368 (1981).

    Article  MathSciNet  Google Scholar 

  5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1977).

    MATH  Google Scholar 

  6. J. Matoušek, Using the Borsuk–Ulam Theorem (Springer-Verlag, Berlin, 2003).

    MATH  Google Scholar 

  7. B. Bollobás, Random Graphs, 2nd. ed., (Cambridge Univ. Press, Cambridge, 2001).

    Book  MATH  Google Scholar 

  8. L. I. Bogolyubskii, A. S. Gusev, M. M. Pyaderkin, and A. M. Raigorodskii, Dokl. Math. 90 (1), 462–465 (2014).

    Article  MathSciNet  Google Scholar 

  9. L. I. Bogolyubskii, A. S. Gusev, M. M. Pyaderkin, and A. M. Raigorodskii, Sb. Math. 206 (10), 1340–1374 (2015).

    Article  MathSciNet  Google Scholar 

  10. B. Bollobás, B. P. Narayanan, and A. M. Raigorodskii, J. Combin. Theor. Ser. A 137, 64–78 (2016).

    Article  Google Scholar 

  11. P. Erdos, Ch. Ko, and R. Rado, Quart. J. Math. Oxford 12 (1), 313–320 (1961).

    Article  MathSciNet  Google Scholar 

  12. M. M. Pyaderkin, Math. Notes 99 (4), 556–563 (2016).

    Article  Google Scholar 

  13. M. M. Pyaderkin, Math. Notes 99 (2), 312–319 (2016).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology (State University), Dolgoprudnyi, Moscow oblast, 141700, Russia

    M. M. Pyaderkin & A. M. Raigorodskii

  2. Mechanics and Mathematics Faculty, Moscow State University, Moscow, 119991, Russia

    M. M. Pyaderkin & A. M. Raigorodskii

  3. Institute of Mathematics and Computer Science, Buryat State University, Ulan-Ude, Buryat Republic, 670000, Russia

    A. M. Raigorodskii

Authors
  1. M. M. Pyaderkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. M. Raigorodskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. M. Raigorodskii.

Additional information

Original Russian Text © M.M. Pyaderkin, A.M. Raigorodskii, 2016, published in Doklady Akademii Nauk, 2016, Vol. 470, No. 4, pp. 384–386.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pyaderkin, M.M., Raigorodskii, A.M. On random subgraphs of Kneser graphs and their generalizations. Dokl. Math. 94, 547–549 (2016). https://doi.org/10.1134/S106456241605015X

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Search

Navigation