ReP USP - Resultado da busca

Artigo de periodico
On some extremal results for order types (2019)
Han, Jie ; Kohayakawa, Yoshiharu ; Sales, Marcelo Tadeu; Stagni, Henrique
Source: Acta Mathematica Universitatis Comenianae. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. On some extremal results for order types. Acta Mathematica Universitatis Comenianae, v. 88, n. 3, p. 779-785, 2019Tradução . . Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305. Acesso em: 19 nov. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). On some extremal results for order types. Acta Mathematica Universitatis Comenianae, 88( 3), 779-785. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.[citado 2024 nov. 19 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. On some extremal results for order types [Internet]. Acta Mathematica Universitatis Comenianae. 2019 ; 88( 3): 779-785.[citado 2024 nov. 19 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1305
Trabalho de evento
Extremal and probabilistic results for order types (2019)
Han, Jie; Kohayakawa, Yoshiharu ; Sales, Marcelo T; Stagni, Henrique
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: COMBINATÓRIA PROBABILÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie et al. Extremal and probabilistic results for order types. 2019, Anais.. Philadelphia: SIAM, 2019. Disponível em: https://doi.org/10.1137/1.9781611975482.27. Acesso em: 19 nov. 2024.
APA
Han, J., Kohayakawa, Y., Sales, M. T., & Stagni, H. (2019). Extremal and probabilistic results for order types. In Proceedings. Philadelphia: SIAM. doi:10.1137/1.9781611975482.27
NLM
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Vancouver
Han J, Kohayakawa Y, Sales MT, Stagni H. Extremal and probabilistic results for order types [Internet]. Proceedings. 2019 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1137/1.9781611975482.27
Artigo de periodico
Infinite Sidon sets contained in sparse random sets of integers (2018)
Kohayakawa, Yoshiharu ; Lee, Sang June; Moreira, Carlos Gustavo; Rödl, Vojtěch
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: TEORIA DOS NÚMEROS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Infinite Sidon sets contained in sparse random sets of integers. SIAM Journal on Discrete Mathematics, v. 32, n. 1, p. 410-449, 2018Tradução . . Disponível em: https://doi.org/10.1137/17M1114934. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Lee, S. J., Moreira, C. G., & Rödl, V. (2018). Infinite Sidon sets contained in sparse random sets of integers. SIAM Journal on Discrete Mathematics, 32( 1), 410-449. doi:10.1137/17M1114934
NLM
Kohayakawa Y, Lee SJ, Moreira CG, Rödl V. Infinite Sidon sets contained in sparse random sets of integers [Internet]. SIAM Journal on Discrete Mathematics. 2018 ; 32( 1): 410-449.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1137/17M1114934
Vancouver
Kohayakawa Y, Lee SJ, Moreira CG, Rödl V. Infinite Sidon sets contained in sparse random sets of integers [Internet]. SIAM Journal on Discrete Mathematics. 2018 ; 32( 1): 410-449.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1137/17M1114934
Artigo de periodico
Counting results for sparse pseudorandom hypergraphs I (2017)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
Source: European Journal of Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics, v. 65, p. 276-287, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2017.04.008. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2017). Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics, 65, 276-287. doi:10.1016/j.ejc.2017.04.008
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs I [Internet]. European Journal of Combinatorics. 2017 ; 65 276-287.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.008
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs I [Internet]. European Journal of Combinatorics. 2017 ; 65 276-287.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.008
Artigo de periodico
Counting results for sparse pseudorandom hypergraphs II (2017)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
Source: European Journal of Combinatorics. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics, v. 65, p. 288-301, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2017.04.007. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2017). Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics, 65, 288-301. doi:10.1016/j.ejc.2017.04.007
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs II [Internet]. European Journal of Combinatorics. 2017 ; 65 288-301.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.007
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs II [Internet]. European Journal of Combinatorics. 2017 ; 65 288-301.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.007
Artigo de periodico
The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family (2017)
Han, Jie; Kohayakawa, Yoshiharu
Source: Proceedings of the American Mathematical Society. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAN, Jie e KOHAYAKAWA, Yoshiharu. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family. Proceedings of the American Mathematical Society, v. 145, n. 1, p. 73-87, 2017Tradução . . Disponível em: https://doi.org/10.1090/proc/13221. Acesso em: 19 nov. 2024.
APA
Han, J., & Kohayakawa, Y. (2017). The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family. Proceedings of the American Mathematical Society, 145( 1), 73-87. doi:10.1090/proc/13221
NLM
Han J, Kohayakawa Y. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family [Internet]. Proceedings of the American Mathematical Society. 2017 ; 145( 1): 73-87.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1090/proc/13221
Vancouver
Han J, Kohayakawa Y. The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family [Internet]. Proceedings of the American Mathematical Society. 2017 ; 145( 1): 73-87.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1090/proc/13221
Artigo de periodico
On the number of Bh-Sets (2016)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech; Samotij, Wojciech
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS NÚMEROS, SEQUÊNCIAS, COMBINATÓRIA, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. On the number of Bh-Sets. Combinatorics, Probability & Computing, v. 25, n. Ja 2016, p. 108-129, 2016Tradução . . Disponível em: https://doi.org/10.1017/S0963548315000206. Acesso em: 19 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rodl, V., & Samotij, W. (2016). On the number of Bh-Sets. Combinatorics, Probability & Computing, 25( Ja 2016), 108-129. doi:10.1017/S0963548315000206
NLM
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1017/S0963548315000206
Vancouver
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1017/S0963548315000206
Artigo de periodico
Sparse partition universal graphs for graphs of bounded degree (2011)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Szemerédi, Endre
Source: Advances in Mathematics. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Sparse partition universal graphs for graphs of bounded degree. Advances in Mathematics, v. 226, n. 6, p. 5041-5065, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.aim.2011.01.004. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Rodl, V., Schacht, M., & Szemerédi, E. (2011). Sparse partition universal graphs for graphs of bounded degree. Advances in Mathematics, 226( 6), 5041-5065. doi:10.1016/j.aim.2011.01.004
NLM
Kohayakawa Y, Rodl V, Schacht M, Szemerédi E. Sparse partition universal graphs for graphs of bounded degree [Internet]. Advances in Mathematics. 2011 ; 226( 6): 5041-5065.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.aim.2011.01.004
Vancouver
Kohayakawa Y, Rodl V, Schacht M, Szemerédi E. Sparse partition universal graphs for graphs of bounded degree [Internet]. Advances in Mathematics. 2011 ; 226( 6): 5041-5065.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.aim.2011.01.004
Trabalho de evento
The maximum size of a Sidon set contained in sparse random set of integers (2011)
Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech
Source: proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms. Unidade: IME
Assunto: ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LEE, Sang June e RODL, Vojtech. The maximum size of a Sidon set contained in sparse random set of integers. 2011, Anais.. Philadelphia: SIAM, 2011. Disponível em: https://dl.acm.org/citation.cfm?id=2133050. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Lee, S. J., & Rodl, V. (2011). The maximum size of a Sidon set contained in sparse random set of integers. In proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=2133050
NLM
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 nov. 19 ] Available from: https://dl.acm.org/citation.cfm?id=2133050
Vancouver
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 nov. 19 ] Available from: https://dl.acm.org/citation.cfm?id=2133050
Artigo de periodico
Weak hypergraph regularity and linear hypergraphs (2010)
Kohayakawa, Yoshiharu ; Nagle, Brendan; Rodl, Vojtech; Schacht, Mathias
Source: Journal of Combinatorial Theory. Ser. B.. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Weak hypergraph regularity and linear hypergraphs. Journal of Combinatorial Theory. Ser. B., v. 100, n. 2, p. 151-160, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2009.05.005. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Nagle, B., Rodl, V., & Schacht, M. (2010). Weak hypergraph regularity and linear hypergraphs. Journal of Combinatorial Theory. Ser. B., 100( 2), 151-160. doi:10.1016/j.jctb.2009.05.005
NLM
Kohayakawa Y, Nagle B, Rodl V, Schacht M. Weak hypergraph regularity and linear hypergraphs [Internet]. Journal of Combinatorial Theory. Ser. B. 2010 ; 100( 2): 151-160.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jctb.2009.05.005
Vancouver
Kohayakawa Y, Nagle B, Rodl V, Schacht M. Weak hypergraph regularity and linear hypergraphs [Internet]. Journal of Combinatorial Theory. Ser. B. 2010 ; 100( 2): 151-160.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jctb.2009.05.005
Parte de monografia/livro
On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)
Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Schacht, Mathias; Skokan, Jozef
Source: An irregular mind. Unidade: IME
Subjects: MÉTODOS PROBABILÍSTICOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 19 nov. 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 nov. 19 ] 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 nov. 19 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10
Trabalho de evento
Universality of random graphs (2008)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Ruciński, Andrzej
Source: Proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms - SODA. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. Universality of random graphs. 2008, Anais.. Philadelphia: SIAM, 2008. Disponível em: https://dl.acm.org/citation.cfm?id=1347168. Acesso em: 19 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., RÖdlt, V. Ě., & Ruciński, A. (2008). Universality of random graphs. In Proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=1347168
NLM
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 nov. 19 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Vancouver
Dellamonica Junior D, Kohayakawa Y, RÖdlt VĚ, Ruciński A. Universality of random graphs [Internet]. Proceedings. 2008 ;[citado 2024 nov. 19 ] Available from: https://dl.acm.org/citation.cfm?id=1347168
Artigo de periodico
JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness (2008)
Zich, Jan; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Sunderam, Vaidy
Source: Internet Mathematics. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ZICH, Jan et al. JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness. Internet Mathematics, v. 5, n. 3, p. 227-250, 2008Tradução . . Disponível em: https://doi.org/10.1080/15427951.2008.10129165. Acesso em: 19 nov. 2024.
APA
Zich, J., Kohayakawa, Y., Rodl, V., & Sunderam, V. (2008). JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness. Internet Mathematics, 5( 3), 227-250. doi:10.1080/15427951.2008.10129165
NLM
Zich J, Kohayakawa Y, Rodl V, Sunderam V. JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness [Internet]. Internet Mathematics. 2008 ; 5( 3): 227-250.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1080/15427951.2008.10129165
Vancouver
Zich J, Kohayakawa Y, Rodl V, Sunderam V. JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness [Internet]. Internet Mathematics. 2008 ; 5( 3): 227-250.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1080/15427951.2008.10129165
Artigo de periodico
Essentially infinite colourings of hypergraphs (2007)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Taraz, Anusch
Source: Proceedings of the London Mathematical Society. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla et al. Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 709-734, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm024. Acesso em: 19 nov. 2024.
APA
Bollobás, B., Kohayakawa, Y., Rodl, V., Schacht, M., & Taraz, A. (2007). Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, 95( 3), 709-734. doi:10.1112/plms/pdm024
NLM
Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1112/plms/pdm024
Vancouver
Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1112/plms/pdm024
Artigo de periodico
Small subsets inherit sparse ε-regularity (2007)
Gerke, Stephanie; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Steger, Angelika
Source: Journal of Combinatorial Theory. Series B. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GERKE, Stephanie et al. Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory. Series B, v. 97, n. 1, p. 34-56, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2006.03.004. Acesso em: 19 nov. 2024.
APA
Gerke, S., Kohayakawa, Y., Rodl, V., & Steger, A. (2007). Small subsets inherit sparse ε-regularity. Journal of Combinatorial Theory. Series B, 97( 1), 34-56. doi:10.1016/j.jctb.2006.03.004
NLM
Gerke S, Kohayakawa Y, Rodl V, Steger A. Small subsets inherit sparse ε-regularity [Internet]. Journal of Combinatorial Theory. Series B. 2007 ; 97( 1): 34-56.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jctb.2006.03.004
Vancouver
Gerke S, Kohayakawa Y, Rodl V, Steger A. Small subsets inherit sparse ε-regularity [Internet]. Journal of Combinatorial Theory. Series B. 2007 ; 97( 1): 34-56.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jctb.2006.03.004
Artigo de periodico
Turan's theorem for pseudo-random graphs (2007)
Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Sissokho, Papa; Skokan, Jozef
Source: Journal of Combinatorial Theory, Serie A. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, v. 114, n. 4, p. 631-657, 2007Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2006.08.004. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Rodl, V., Schacht, M., Sissokho, P., & Skokan, J. (2007). Turan's theorem for pseudo-random graphs. Journal of Combinatorial Theory, Serie A, 114( 4), 631-657. doi:10.1016/j.jcta.2006.08.004
NLM
Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004
Vancouver
Kohayakawa Y, Rodl V, Schacht M, Sissokho P, Skokan J. Turan's theorem for pseudo-random graphs [Internet]. Journal of Combinatorial Theory, Serie A. 2007 ; 114( 4): 631-657.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jcta.2006.08.004
Artigo de periodico
Measures of pseudorandomness for finite sequences: typical values (2007)
Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Christian; Moreira, Carlos Gustavo; Rodl, Vojtech
Source: Proceedings of the London Mathematical Society. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, MATEMÁTICA DISCRETA, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 778-812, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm027. Acesso em: 19 nov. 2024.
APA
Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, V. (2007). Measures of pseudorandomness for finite sequences: typical values. Proceedings of the London Mathematical Society, 95( 3), 778-812. doi:10.1112/plms/pdm027
NLM
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1112/plms/pdm027
Vancouver
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl V. Measures of pseudorandomness for finite sequences: typical values [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 778-812.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1112/plms/pdm027
Artigo de periodico
Measures of pseudorandomness for finite sequences: minimal values (2006)
Alon, Noga; Kohayakawa, Yoshiharu ; Mauduit, Caroline; Moreira, C. G; Rodl, M
Source: Combinatorics Probability & Computing. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALON, Noga et al. Measures of pseudorandomness for finite sequences: minimal values. Combinatorics Probability & Computing, v. 15, n. 1-2, p. 1-29, 2006Tradução . . Disponível em: https://doi.org/10.1017/S0963548305007170. Acesso em: 19 nov. 2024.
APA
Alon, N., Kohayakawa, Y., Mauduit, C., Moreira, C. G., & Rodl, M. (2006). Measures of pseudorandomness for finite sequences: minimal values. Combinatorics Probability & Computing, 15( 1-2), 1-29. doi:10.1017/S0963548305007170
NLM
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl M. Measures of pseudorandomness for finite sequences: minimal values [Internet]. Combinatorics Probability & Computing. 2006 ; 15( 1-2): 1-29.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1017/S0963548305007170
Vancouver
Alon N, Kohayakawa Y, Mauduit C, Moreira CG, Rodl M. Measures of pseudorandomness for finite sequences: minimal values [Internet]. Combinatorics Probability & Computing. 2006 ; 15( 1-2): 1-29.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1017/S0963548305007170
Artigo de periodico
The hypergraph regularity method and its applications (2005)
Rodl, Vojtech; Nagle, Brendan; Skokan, Jozef; Schatcht, M.; Kohayakawa, Yoshiharu
Source: Proceedings of the National Academy of Sciences of the United States of America. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 19 nov. 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 nov. 19 ] 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 nov. 19 ] Available from: https://doi.org/10.1073/pnas.0502771102
Trabalho de evento-anais periodico
The 3-colored Ramsey number of odd cycles (2005)
Kohayakawa, Yoshiharu ; Simonovits, Maklós; Skokan, Jozef
Source: Electronic Notes in Discrete Mathematics. Conference titles: Brazilian Symposium on Graphs, Algorithms and Combinatorics - GRACO. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e SIMONOVITS, Maklós e SKOKAN, Jozef. The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.endm.2005.05.053. Acesso em: 19 nov. 2024. , 2005
APA
Kohayakawa, Y., Simonovits, M., & Skokan, J. (2005). The 3-colored Ramsey number of odd cycles. Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier. doi:10.1016/j.endm.2005.05.053
NLM
Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053
Vancouver
Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles [Internet]. Electronic Notes in Discrete Mathematics. 2005 ; 19 397-402.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.endm.2005.05.053

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Non normalized affiliation

Countries of institutions of collaboration