Random constructions of hypergraphs with large girth and without panchromatic colorings
Fundamentalʹnaâ i prikladnaâ matematika, Tome 23 (2020) no. 1, pp. 269-283
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{FPM_2020_23_1_a15,
author = {A. E. Khuzieva},
title = {Random constructions of hypergraphs with large girth and without panchromatic colorings},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {269--283},
publisher = {mathdoc},
volume = {23},
number = {1},
year = {2020},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2020_23_1_a15/}
}
TY - JOUR AU - A. E. Khuzieva TI - Random constructions of hypergraphs with large girth and without panchromatic colorings JO - Fundamentalʹnaâ i prikladnaâ matematika PY - 2020 SP - 269 EP - 283 VL - 23 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/FPM_2020_23_1_a15/ LA - ru ID - FPM_2020_23_1_a15 ER -
A. E. Khuzieva. Random constructions of hypergraphs with large girth and without panchromatic colorings. Fundamentalʹnaâ i prikladnaâ matematika, Tome 23 (2020) no. 1, pp. 269-283. http://geodesic.mathdoc.fr/item/FPM_2020_23_1_a15/