3 citations · 7 across the 34 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
D. D. Cherkashin, A. B. Kulikov, A. M. Raigorodskii
In 1973 P. Erdős and L. Lovász noticed that any hypergraph whose edges are pairwise intersecting has chromatic number 2 or 3. In the first case, such hypergraph may have any number…
math.CO2011★ 3 cited
About maximal number of edges in hypergraph-clique with chromatic number 3
Danila D. Cherkashin
Let be a hypergraph. By the chromatic number of a hypergraph we mean the minimum number of colors needed to paint all the vertices in so th…