Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Margarita Akhmejanova"'
Autor:
Margarita Akhmejanova, Konstantin Olmezov, Aleksei Volostnov, Ilya Vorobyev, Konstantin Vorob’ev, Yury Yarovikov
Publikováno v:
Discrete Applied Mathematics. 325:37-42
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d01d66cbebe6187781b4f18fb7a7033
https://doi.org/10.1016/j.dam.2022.09.021
https://doi.org/10.1016/j.dam.2022.09.021
Publikováno v:
Discrete Applied Mathematics. 321:72-81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c818e67b1f0b3a5c0d6ea6c9af6ca580
https://doi.org/10.1016/j.dam.2022.06.005
https://doi.org/10.1016/j.dam.2022.06.005
Publikováno v:
Matematicheskie Zametki. 106:323-332
Раскраска в два цвета называется справедливой, если, с одной стороны, нет одноцветных ребер (правильная раскраска), а с другой стороны, мо
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::851f7d6d0621aa9e8a7ce4e600075cb7
https://doi.org/10.4213/mzm11967
https://doi.org/10.4213/mzm11967
Publikováno v:
Electronic Notes in Discrete Mathematics. 61:29-35
The paper deals with an extremal problem concerning colorings of hypergraphs with bounded edge degrees. Consider the family of b-simple hypergraphs, in which any two edges do not share more than b common vertices. We prove that for n ≥ n 0 ( b ) ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0c8572e730f018be709d1811a4c0ca6c
https://doi.org/10.1016/j.endm.2017.06.017
https://doi.org/10.1016/j.endm.2017.06.017
The paper deals with an extremal problem concerning colorings of hypergraphs with bounded edge degrees. Consider the family of b -simple hypergraphs, in which any two edges do not share more than b common vertices. We prove that for n ⩾ n 0 ( b ) ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54c3d99bf50f39a139743813a5b15679
http://arxiv.org/abs/1909.00448
http://arxiv.org/abs/1909.00448
The paper deals with an extremal problem concerning equitable colorings of uniform hypergraph. Recall that a vertex coloring of a hypergraph H is called proper if there are no monochromatic edges under this coloring. A hypergraph is said to be equita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7131183eec8b5aabd9666b4dea788f9