Threshold probabilities for colourings of random hypergraphs
- Authors: Koshelev M.M.1,2, Shabanov D.A.1,3, Shaikheeva T.M.1
-
Affiliations:
- Moscow Institute of Physics and Technology (National Research University)
- Lomonosov Moscow State University
- HSE University
- Issue: Vol 80, No 1 (2025)
- Pages: 161-162
- Section: Articles
- URL: https://bakhtiniada.ru/0042-1316/article/view/306740
- DOI: https://doi.org/10.4213/rm10222
- ID: 306740
Cite item
Abstract
About the authors
Mikhail Mikhaylovich Koshelev
Moscow Institute of Physics and Technology (National Research University); Lomonosov Moscow State University
Email: mkoshelev99@gmail.com
without scientific degree, no status
Dmitry Aleksandrovich Shabanov
Moscow Institute of Physics and Technology (National Research University); HSE University
Email: shabanov.da@mipt.ru
Doctor of physico-mathematical sciences, Associate professor
Taliya Maratovna Shaikheeva
Moscow Institute of Physics and Technology (National Research University)
Email: talia.shaikheeva@yandex.ru
References
- H. Hatami, M. Molloy, Random Structures Algorithms, 33:3 (2008), 310–332
- A. Coja-Oghlan, K. Panagiotou, STOC'12: Proceedings of the 2012 ACM symposium on theory of computing, ACM, New York, 2012, 899–907
- Д. А. Кравцов, Н. Е. Крохмаль, Д. А. Шабанов, Дискрет. матем., 31:2 (2019), 84–113
- П. А. Захаров, Д. А. Шабанов, УМН, 78:6(474) (2023), 183–184
- Д. А. Шабанов, Т. М. Шайхеева, Труды МФТИ, 16:3 (2024), 81–91
Supplementary files
