|
Fundamentalnaya i Prikladnaya Matematika, 2013, Volume 18, Issue 3, Pages 77–115
(Mi fpm1518)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
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.
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
Linking options:
https://www.mathnet.ru/eng/fpm1518 https://www.mathnet.ru/eng/fpm/v18/i3/p77
|
Statistics & downloads: |
Abstract page: | 417 | Full-text PDF : | 182 | References: | 60 | First page: | 2 |
|