Author:
Cherkashin Danila,Kiselev Sergei
Funder
Russian Science Foundation
Publisher
Springer Science and Business Media LLC
Reference43 articles.
1. Ahlswede, R., Khachatrian, L.H.: The complete intersection theorem for systems of finite sets. Eur. J. Combin. 18(2), 125–136 (1997)
2. Arman, A., Retter, T.: An upper bound for the size of a $$k$$-uniform intersecting family with covering number $$k$$. J. Combin. Theory Ser. A 147, 18–26 (2017)
3. Balogh, J., Kostochka, A., Raigorodskii, A.: Coloring some finite sets in $$\mathbb{R} ^n$$. Discuss. Math. Graph Theory 33(1), 25–31 (2013)
4. Cherkashin, D.D.: About maximal number of edges in hypergraph-clique with chromatic number 3. Moscow J. Combin. Number Theory 1(3), 3–11 (2011)
5. Cherkashin, D.D.: On the chromatic numbers of Johnson-type graphs. Zapiski Nauchnykh Seminarov POMI 518, 192–200 (2022)