|
This article is cited in 2 scientific papers (total in 2 papers)
On regular hypergraphs with high girth and high chromatic number
A. E. Khuzievaa, D. A. Shabanovb a Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
b Lomonosov Moscow State University
Abstract:
The 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.
Keywords:
hypergraph, colouring of hypergraphs, sparse hypergraphs, random recolouring method, girth of a hypergraph.
Received: 06.04.2015
Citation:
A. E. Khuzieva, D. A. Shabanov, “On regular hypergraphs with high girth and high chromatic number”, Diskr. Mat., 27:2 (2015), 112–133; Discrete Math. Appl., 25:5 (2015), 277–294
Linking options:
https://www.mathnet.ru/eng/dm1329https://doi.org/10.4213/dm1329 https://www.mathnet.ru/eng/dm/v27/i2/p112
|
Statistics & downloads: |
Abstract page: | 455 | Full-text PDF : | 176 | References: | 52 | First page: | 35 |
|