Fractional colourings of random hypergraphs

作者: Zakharov P.A.¹^,2, Shabanov D.A.¹^,2
隶属关系:
1. Moscow Institute of Physics and Technology (National Research University)
2. HSE University
期: 卷 78, 编号 6 (2023)
页面: 183-184
栏目: Articles
URL: https://journals.rcsi.science/0042-1316/article/view/147971
DOI: https://doi.org/10.4213/rm10151
ID: 147971

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

Moscow Institute of Physics and Technology (National Research University); HSE University

Moscow Institute of Physics and Technology (National Research University); HSE University

Email: shabanov@mech.math.msu.su
Doctor of physico-mathematical sciences, Associate professor

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

附件文件

动作

1. JATS XML