Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Dmitry Kravstov"'
Publikováno v:
European Journal of Combinatorics. 78:28-43
The paper deals with panchromatic 3-colorings of random hypergraphs. A vertex 3-coloring is said to be panchromatic for a hypergraph if every color can be found on every edge. Let H ( n , k , p ) denote the binomial model of a random k -uniform hyper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82e770e1fe76f05d809303133c33e712
https://doi.org/10.1016/j.ejc.2019.01.006
https://doi.org/10.1016/j.ejc.2019.01.006
