The hypergraph regularity method and its applications (2005)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1073/pnas.0502771102
- Assunto: TEORIA DOS GRAFOS
- Keywords: Szemerédi’s theorem; regularity lemma; counting lemma; removal lemma
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher place: Washington
- Date published: 2005
- Source:
- Título do periódico: Proceedings of the National Academy of Sciences of the United States of America
- ISSN: 0027-8424
- Volume/Número/Paginação/Ano: v. 102, n. 23, p. 8109-8113, 2005
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
RODL, Vojtech et al. The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America, v. 102, n. 23, p. 8109-8113, 2005Tradução . . Disponível em: https://doi.org/10.1073/pnas.0502771102. Acesso em: 18 abr. 2024. -
APA
Rodl, V., Nagle, B., Skokan, J., Schatcht, M., & Kohayakawa, Y. (2005). The hypergraph regularity method and its applications. Proceedings of the National Academy of Sciences of the United States of America, 102( 23), 8109-8113. doi:10.1073/pnas.0502771102 -
NLM
Rodl V, Nagle B, Skokan J, Schatcht M, Kohayakawa Y. The hypergraph regularity method and its applications [Internet]. Proceedings of the National Academy of Sciences of the United States of America. 2005 ; 102( 23): 8109-8113.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1073/pnas.0502771102 -
Vancouver
Rodl V, Nagle B, Skokan J, Schatcht M, Kohayakawa Y. The hypergraph regularity method and its applications [Internet]. Proceedings of the National Academy of Sciences of the United States of America. 2005 ; 102( 23): 8109-8113.[citado 2024 abr. 18 ] Available from: https://doi.org/10.1073/pnas.0502771102 - A practical minimal perfect hashing method
- Evolution of random subgraphs of the cube
- On Richardson's model on the hypercube
- The Turan theorem for random graphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Universality and tolerance
- Hereditary properties of triple systems
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- Discrepancy and eigenvalues of Cayley graphs
Informações sobre o DOI: 10.1073/pnas.0502771102 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas