Geodesic
Extremal problems in hypergraph colourings
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 75 (2020) no. 1, pp. 89-146

Voir la notice de l'article provenant de la source Math-Net.Ru

Extremal problems in hypergraph colouring originate implicitly from Hilbert's theorem on monochromatic affine cubes (1892) and van der Waerden's theorem on monochromatic arithmetic progressions (1927). Later, with the advent and elaboration of Ramsey theory, the variety of problems related to colouring of explicitly specified hypergraphs widened rapidly. However, a systematic study of extremal problems on hypergraph colouring was initiated only in the works of Erdős and Hajnal in the 1960s. This paper is devoted to problems of finding edge-minimum hypergraphs belonging to particular classes of hypergraphs, variations of these problems, and their applications. The central problem of this kind is the Erdős–Hajnal problem of finding the minimum number of edges in an $n$-uniform hypergraph with chromatic number at least three. The main purpose of this survey is to spotlight the progress in this area over the last several years. Bibliography: 168 titles.
Keywords: extremal combinatorics, hypergraph colourings. 
@article{RM_2020_75_1_a1,
     author = {A. M. Raigorodskii and D. D. Cherkashin},
     title = {Extremal problems in hypergraph colourings},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {89--146},
     publisher = {mathdoc},
     volume = {75},
     number = {1},
     year = {2020},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2020_75_1_a1/}
}
TY  - JOUR
AU  - A. M. Raigorodskii
AU  - D. D. Cherkashin
TI  - Extremal problems in hypergraph colourings
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2020
SP  - 89
EP  - 146
VL  - 75
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/RM_2020_75_1_a1/
LA  - en
ID  - RM_2020_75_1_a1
ER  - 
%0 Journal Article
%A A. M. Raigorodskii
%A D. D. Cherkashin
%T Extremal problems in hypergraph colourings
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2020
%P 89-146
%V 75
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/RM_2020_75_1_a1/
%G en
%F RM_2020_75_1_a1
A. M. Raigorodskii; D. D. Cherkashin. Extremal problems in hypergraph colourings. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 75 (2020) no. 1, pp. 89-146. http://geodesic.mathdoc.fr/item/RM_2020_75_1_a1/