RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskr. Mat., 2012, Volume 24, Issue 1, Pages 79–107 (Mi dm1174)  

This article is cited in 7 scientific papers (total in 7 papers)

Estimation of the number of maximal extensions in a random graph

M. E. Zhukovskii


DOI: https://doi.org/10.4213/dm1174

Full text: PDF file (294 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2012, 22:1, 55–90

Bibliographic databases:

UDC: 519.2
Received: 13.10.2010

Citation: M. E. Zhukovskii, “Estimation of the number of maximal extensions in a random graph”, Diskr. Mat., 24:1 (2012), 79–107; Discrete Math. Appl., 22:1 (2012), 55–90

Citation in format AMSBIB
\Bibitem{Zhu12}
\by M.~E.~Zhukovskii
\paper Estimation of the number of maximal extensions in a~random graph
\jour Diskr. Mat.
\yr 2012
\vol 24
\issue 1
\pages 79--107
\mathnet{http://mi.mathnet.ru/dm1174}
\crossref{https://doi.org/10.4213/dm1174}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2964292}
\elib{http://elibrary.ru/item.asp?id=20730416}
\transl
\jour Discrete Math. Appl.
\yr 2012
\vol 22
\issue 1
\pages 55--90
\crossref{https://doi.org/10.1515/dma-2012-006}
\elib{http://elibrary.ru/item.asp?id=18135599}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84858793247}


Linking options:
  • http://mi.mathnet.ru/eng/dm1174
  • https://doi.org/10.4213/dm1174
  • http://mi.mathnet.ru/eng/dm/v24/i1/p79

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. M. E. Zhukovskii, “Extension of the zero-one $k$-law”, Dokl. Math., 89:1 (2014), 16–19  crossref  crossref  mathscinet  zmath  zmath  isi  elib  elib  scopus
    2. M. E. Zhukovskii, A. M. Raigorodskii, “Random graphs: models and asymptotic characteristics”, Russian Math. Surveys, 70:1 (2015), 33–81  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    3. M. E. Zhukovskii, “On the zero-one $k$-law extensions”, Eur. J. Comb., 60 (2017), 66–81  crossref  mathscinet  zmath  isi  elib  scopus
    4. M. E. Zhukovskii, “Quantifier alternation in first-order formulas with infinite spectra”, Problems Inform. Transmission, 53:4 (2017), 391–403  mathnet  crossref  isi  elib
    5. A. D. Matushkin, M. E. Zhukovskii, “First order sentences about random graphs: small number of alternations”, Discrete Appl. Math., 236 (2018), 329–346  crossref  mathscinet  zmath  isi  scopus
    6. S. N. Popova, “Infinite spectra of first-order properties for random hypergraphs”, Problems Inform. Transmission, 54:3 (2018), 281–289  mathnet  crossref  isi
    7. Kupavskii A., Zhukovskii M., “Short Monadic Second Order Sentences About Sparse Random Graphs”, SIAM Discret. Math., 32:4 (2018), 2916–2940  crossref  isi
  • Дискретная математика
    Number of views:
    This page:333
    Full text:91
    References:43
    First page:31

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019