Near-perfect clique-factors in sparse pseudorandom graphs (2021)
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, PROGRAMAÇÃO MATEMÁTICA
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu e PERSON, Yury. Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, v. 30, n. 4, p. 570-590, 2021Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000577. Acesso em: 18 ago. 2024.APA
Han, J., Kohayakawa, Y., & Person, Y. (2021). Near-perfect clique-factors in sparse pseudorandom graphs. Combinatorics, Probability & Computing, 30( 4), 570-590. doi:10.1017/S0963548320000577NLM
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1017/S0963548320000577Vancouver
Han J, Kohayakawa Y, Person Y. Near-perfect clique-factors in sparse pseudorandom graphs [Internet]. Combinatorics, Probability & Computing. 2021 ; 30( 4): 570-590.[citado 2024 ago. 18 ] Available from: https://doi.org/10.1017/S0963548320000577