Fractional colourings of random hypergraphs
- Autores: Zakharov P.A.1,2, Shabanov D.A.1,2
-
Afiliações:
- Moscow Institute of Physics and Technology (National Research University)
- HSE University
- Edição: Volume 78, Nº 6 (2023)
- Páginas: 183-184
- Seção: Articles
- URL: https://journals.rcsi.science/0042-1316/article/view/147971
- DOI: https://doi.org/10.4213/rm10151
- ID: 147971
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
Sobre autores
Pavel Zakharov
Moscow Institute of Physics and Technology (National Research University); HSE University
Email: pazakharov@hse.ru
Dmitry Shabanov
Moscow Institute of Physics and Technology (National Research University); HSE University
Email: shabanov@mech.math.msu.su
Doctor of physico-mathematical sciences, Associate professor
Bibliografia
- H. Hatami, M. Molloy, Random Structures Algorithms, 33:3 (2008), 310–332
- N. Alon, J. Spencer, A note on coloring random $k$-sets, unpublished manuscript, 5 pp.
- D. Achlioptas, C. Moore, SIAM J. Comput., 36:3 (2005), 740–762
- A. Coja-Oghlan, L. Zdeborova, Proceedings of the twenty-third annual ACM–SIAM symposium on discrete algorithms (Kyoto, 2012), ACM, New York; SIAM, Philadelphia, PA, 2012, 241–250
- A. Coja-Oghlan, K. Panagiotou, STOC {'}12: Proceedings of the 2012 ACM symposium on theory of computing, ACM, New York, 2012, 899–908
- D. A. Shabanov, Discrete Appl. Math., 282 (2020), 168–183
Arquivos suplementares
