On regular hypergraphs with high girth and high chromatic number
Keyword(s):
AbstractThe paper is concerned with an extremal problem of combinatorial analysis on finding the minimal possible number of edges in an n-regular hypergraph with chromatic number greater than r and girth greater than s. A new lower estimate of this extremal value is obtained and a number of related results is proved.
2017 ◽
Vol 8
(1)
◽
pp. 30
Keyword(s):
2014 ◽
Vol 4
(1)
◽
pp. 27
2021 ◽
Vol 1836
(1)
◽
pp. 012026
1989 ◽
Vol 23
(3)
◽
pp. 31-40
◽
1986 ◽
Vol 84
◽
pp. 213-223
◽
Keyword(s):