Loading [MathJax]/jax/output/CommonHTML/jax.js
Izvestiya: Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. RAN. Ser. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Izvestiya: Mathematics, 2013, Volume 77, Issue 6, Pages 1105–1129
DOI: https://doi.org/10.1070/IM2013v077n06ABEH002671 (Mi im8052) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties

M. I. Isaev

Moscow Institute of Physics and Technology
English version PDF (410 kB) Citations (1) Russian version article
References:
PDF
HTML
DOI: https://doi.org/10.1070/IM2013v077n06ABEH002671
Abstract: We prove an asymptotic formula for the number of Eulerian circuits in graphs with strong mixing properties and with all vertices having even degrees. This number is determined up to a multiplicative error of the form O(n−1/2+ε), where n is the number of vertices.
Keywords: Eulerian circuit, asymptotic analysis, Gaussian integral, algebraic connectivity, Laplacian matrix.
Funding agency Grant number
Russian Foundation for Basic Research 11-01-00398_а
Received: 27.09.2012
Bibliographic databases:
Document Type: Article
UDC: 519.1
MSC: 05C30, 05C45, 41A60
Language: English
Original paper language: Russian
Citation: M. I. Isaev, “Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties”, Izv. Math., 77:6 (2013), 1105–1129
Citation in format AMSBIB
\Bibitem{Isa13}
\by M.~I.~Isaev
\paper Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
\jour Izv. Math.
\yr 2013
\vol 77
\issue 6
\pages 1105--1129
\mathnet{http://mi.mathnet.ru/eng/im8052}
\crossref{https://doi.org/10.1070/IM2013v077n06ABEH002671}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3184107}
\zmath{https://zbmath.org/?q=an:1282.05067}
\adsnasa{https://adsabs.harvard.edu/cgi-bin/bib_query?2013IzMat..77.1105I}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000329032100002}
\elib{https://elibrary.ru/item.asp?id=21276250}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84891352849}
Linking options:
  • https://www.mathnet.ru/eng/im8052
  • https://doi.org/10.1070/IM2013v077n06ABEH002671
  • https://www.mathnet.ru/eng/im/v77/i6/p45
    • This publication is cited in the following 1 articles:
    1. M. Isaev, B. D. McKay, “Complex martingales and asymptotic enumeration”, Random Struct. Algorithms, 52:4 (2018), 617–661  crossref  mathscinet  zmath  isi  scopus
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия Российской академии наук. Серия математическая Izvestiya: Mathematics
    Statistics & downloads:
    Abstract page:470
    Russian version PDF:245
    English version PDF:25
    References:57
    First page:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025