Szemerédi’s regularity lemma for sparse graphs (1997)
Source: Selected papers. Conference titles: Conference on Foundations of Computational Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu. Szemerédi’s regularity lemma for sparse graphs. 1997, Anais.. Berlin: Springer, 1997. Disponível em: https://doi.org/10.1007/978-3-642-60539-0_16. Acesso em: 27 nov. 2025.APA
Kohayakawa, Y. (1997). Szemerédi’s regularity lemma for sparse graphs. In Selected papers. Berlin: Springer. doi:10.1007/978-3-642-60539-0_16NLM
Kohayakawa Y. Szemerédi’s regularity lemma for sparse graphs [Internet]. Selected papers. 1997 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-642-60539-0_16Vancouver
Kohayakawa Y. Szemerédi’s regularity lemma for sparse graphs [Internet]. Selected papers. 1997 ;[citado 2025 nov. 27 ] Available from: https://doi.org/10.1007/978-3-642-60539-0_16
