On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-14444-8_10
- Subjects: MÉTODOS PROBABILÍSTICOS; TEORIA DOS GRAFOS
- Keywords: bipartite graph; random graph; triple system; arithmetic progression; finite abelian group
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: An irregular mind
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
KOHAYAKAWA, Yoshiharu et al. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 03 out. 2024. -
APA
Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10 -
NLM
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10 -
Vancouver
Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2024 out. 03 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10 - 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.1007/978-3-642-14444-8_10 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas