@article{RM_2023_78_6_a4,
author = {P. A. Zakharov and D. A. Shabanov},
title = {Fractional colourings of random hypergraphs},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {1161--1163},
year = {2023},
volume = {78},
number = {6},
language = {en},
url = {http://geodesic.mathdoc.fr/item/RM_2023_78_6_a4/}
}
P. A. Zakharov; D. A. Shabanov. Fractional colourings of random hypergraphs. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 78 (2023) no. 6, pp. 1161-1163. http://geodesic.mathdoc.fr/item/RM_2023_78_6_a4/
[1] H. Hatami and M. Molloy, Random Structures Algorithms, 33:3 (2008), 310–332 | DOI | MR | Zbl
[2] N. Alon and J. Spencer, A note on coloring random $k$-sets, unpublished manuscript, 5 pp. http://cs.tau.ac.il/~nogaa/PDFS/kset2.pdf
[3] D. Achlioptas and C. Moore, SIAM J. Comput., 36:3 (2005), 740–762 | DOI | MR | Zbl
[4] A. Coja-Oghlan and L. Zdeborová, Proceedings of the twenty-third annual ACM–SIAM symposium on discrete algorithms (Kyoto 2012), ACM, New York; SIAM, Philadelphia, PA, 2012, 241–250 | DOI | MR | Zbl
[5] A. Coja-Oghlan and K. Panagiotou, STOC {'}12: Proceedings of the 2012 ACM symposium on theory of computing, ACM, New York, 2012, 899–908 | DOI | MR | Zbl
[6] D. A. Shabanov, Discrete Appl. Math., 282 (2020), 168–183 | DOI | MR | Zbl