Szemerédi's regularity lemma and quasi-randominess (2003)
Source: Recent advances in algorithms and combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
ABNT
KOHAYAKAWA, Yoshiharu e RÖDLT, VojtĚch. Szemerédi's regularity lemma and quasi-randominess. Recent advances in algorithms and combinatorics. Tradução . New York: Springer, 2003. . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9. Acesso em: 23 ago. 2024.APA
Kohayakawa, Y., & RÖdlt, V. Ě. (2003). Szemerédi's regularity lemma and quasi-randominess. In Recent advances in algorithms and combinatorics. New York: Springer. doi:10.1007/0-387-22444-0_9NLM
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 ago. 23 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9Vancouver
Kohayakawa Y, RÖdlt VĚ. Szemerédi's regularity lemma and quasi-randominess [Internet]. In: Recent advances in algorithms and combinatorics. New York: Springer; 2003. [citado 2024 ago. 23 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/0-387-22444-0_9