|
Fundamentalnaya i Prikladnaya Matematika, 2020, Volume 23, Issue 1, Pages 269–283
(Mi fpm1879)
|
|
|
|
Random constructions of hypergraphs with large girth and without panchromatic colorings
A. E. Khuzieva Moscow Institute of Physics and Technology, Moscow, Russia
Abstract:
We give probabilistic constructions of hypergraphs with large girth that do not admit panchromatic colorings. We prove new upper bounds on the minimal values of the number of edges and the maximum vertex degree in such hypergraphs.
Citation:
A. E. Khuzieva, “Random constructions of hypergraphs with large girth and without panchromatic colorings”, Fundam. Prikl. Mat., 23:1 (2020), 269–283; J. Math. Sci., 262:4 (2022), 581–590
Linking options:
https://www.mathnet.ru/eng/fpm1879 https://www.mathnet.ru/eng/fpm/v23/i1/p269
|
Statistics & downloads: |
Abstract page: | 128 | Full-text PDF : | 46 | References: | 26 |
|