RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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., 2013, Volume 18, Issue 3, Pages 77–115 (Mi fpm1518)  

This article is cited in 1 scientific paper (total in 1 paper)

Colorings of partial Steiner systems and their applications

A. B. Kupavskiia, D. A. Shabanovb

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

Abstract: This paper deals with extremal problems concerning colorings of partial Steiner systems. We establish a new sufficient condition for $r$-colorability of a hypergraph from some class of such systems in terms of maximum vertex degree. Moreover, as a corollary we obtain a new lower bound for the threshold probability for $r$-colorability of a random hypergraph in a binomial model.

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

English version:
Journal of Mathematical Sciences (New York), 2015, 206:5, 511–538

Bibliographic databases:

Document Type: Article
UDC: 519.112.7+519.179.1+519.179.4

Citation: A. B. Kupavskii, D. A. Shabanov, “Colorings of partial Steiner systems and their applications”, Fundam. Prikl. Mat., 18:3 (2013), 77–115; J. Math. Sci., 206:5 (2015), 511–538

Citation in format AMSBIB
\Bibitem{KupSha13}
\by A.~B.~Kupavskii, D.~A.~Shabanov
\paper Colorings of partial Steiner systems and their applications
\jour Fundam. Prikl. Mat.
\yr 2013
\vol 18
\issue 3
\pages 77--115
\mathnet{http://mi.mathnet.ru/fpm1518}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3431804}
\transl
\jour J. Math. Sci.
\yr 2015
\vol 206
\issue 5
\pages 511--538
\crossref{https://doi.org/10.1007/s10958-015-2330-8}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84953369951}


Linking options:
  • http://mi.mathnet.ru/eng/fpm1518
  • http://mi.mathnet.ru/eng/fpm/v18/i3/p77

    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. A. V. Lebedev, “Activity maxima in some models of information networks with random weights and heavy tails”, Problems Inform. Transmission, 51:1 (2015), 66–74  mathnet  crossref  isi  elib
  • Фундаментальная и прикладная математика
    Number of views:
    This page:99
    Full text:44
    References:17
    First page:2

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