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

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


Diskretnaya Matematika, 1992, Volume 4, Issue 3, Pages 75–85 (Mi dm749)  

On the compatibility of a system of random comparisons

V. F. Kolchin
Abstract: We consider a random graph whose each cycle is marked with a certain probability depending on the cycle length. The asymptotic behaviour of the probability of absence of non-marked cycles is described. As a corollary, the asymptotic behaviour of the probability of consistency of a system of random congruences modulo two with random non-equiprobable right-hand sides and also of a system with non-random right-hand sides is described.
Received: 04.01.1992
Bibliographic databases:
Document Type: Article
UDC: 519.2
Language: Russian
Citation: V. F. Kolchin, “On the compatibility of a system of random comparisons”, Diskr. Mat., 4:3 (1992), 75–85; Discrete Math. Appl., 3:1 (1993), 103–113
Citation in format AMSBIB
\Bibitem{Kol92}
\by V.~F.~Kolchin
\paper On the compatibility of a~system of random comparisons
\jour Diskr. Mat.
\yr 1992
\vol 4
\issue 3
\pages 75--85
\mathnet{http://mi.mathnet.ru/dm749}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1220970}
\zmath{https://zbmath.org/?q=an:0798.05049}
\transl
\jour Discrete Math. Appl.
\yr 1993
\vol 3
\issue 1
\pages 103--113
Linking options:
  • https://www.mathnet.ru/eng/dm749
  • https://www.mathnet.ru/eng/dm/v4/i3/p75
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:323
    Full-text PDF :124
    First page:3
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024