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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Fundam. Prikl. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Fundam. Prikl. Mat., 2018, Volume 22, Issue 3, Pages 191–199 (Mi fpm1811)  

On the $s$-colorful number of a random hypergraph

D. A. Shabanovab

a Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
b Lomonosov Moscow State University

Abstract: We study the problem of finding the $s$-colorful number of a random hypergraph in the binomial model. For different probabilities of the edge appearance, we establish asymptotic bounds for the $s$-colorful numbers, which hold with probability tending to $1$.

Funding Agency Grant Number
Russian Science Foundation 16-11-10014


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

UDC: 519.179.1+519.179.4+519.174

Citation: D. A. Shabanov, “On the $s$-colorful number of a random hypergraph”, Fundam. Prikl. Mat., 22:3 (2018), 191–199

Citation in format AMSBIB
\Bibitem{Sha18}
\by D.~A.~Shabanov
\paper On the $s$-colorful number of a~random hypergraph
\jour Fundam. Prikl. Mat.
\yr 2018
\vol 22
\issue 3
\pages 191--199
\mathnet{http://mi.mathnet.ru/fpm1811}


Linking options:
  • http://mi.mathnet.ru/eng/fpm1811
  • http://mi.mathnet.ru/eng/fpm/v22/i3/p191

    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
  • Фундаментальная и прикладная математика
    Number of views:
    This page:43
    Full text:15
    References:13

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