ReP USP - Resultado da busca

Trabalho de evento-anais periodico
Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (2014)
Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lefmann, Hanno
Source: European Journal of Combinatorics. Conference titles: European Conference on Combinatorics, Graph Theory and Applications - EuroComb. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos e KOHAYAKAWA, Yoshiharu e LEFMANN, Hanno. Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. European Journal of Combinatorics. London: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.ejc.2013.06.027. Acesso em: 03 jan. 2026. , 2014
APA
Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2014). Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number. European Journal of Combinatorics. London: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.ejc.2013.06.027
NLM
Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number [Internet]. European Journal of Combinatorics. 2014 ; 35 354-373.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1016/j.ejc.2013.06.027
Vancouver
Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number [Internet]. European Journal of Combinatorics. 2014 ; 35 354-373.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1016/j.ejc.2013.06.027
Artigo de periodico
On the number of orientations of random graphs with no directed cycles of a given length (2014)
Allen, Peter; Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Parente, Roberto Freitas
Source: Electronic Journal of Combinatorics. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. On the number of orientations of random graphs with no directed cycles of a given length. Electronic Journal of Combinatorics, v. 21, n. 1, 2014Tradução . . Disponível em: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf. Acesso em: 03 jan. 2026.
APA
Allen, P., Kohayakawa, Y., Mota, G. O., & Parente, R. F. (2014). On the number of orientations of random graphs with no directed cycles of a given length. Electronic Journal of Combinatorics, 21( 1). Recuperado de http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf
NLM
Allen P, Kohayakawa Y, Mota GO, Parente RF. On the number of orientations of random graphs with no directed cycles of a given length [Internet]. Electronic Journal of Combinatorics. 2014 ; 21( 1):[citado 2026 jan. 03 ] Available from: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf
Vancouver
Allen P, Kohayakawa Y, Mota GO, Parente RF. On the number of orientations of random graphs with no directed cycles of a given length [Internet]. Electronic Journal of Combinatorics. 2014 ; 21( 1):[citado 2026 jan. 03 ] Available from: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p52/pdf
Artigo de periodico
On an anti-Ramsey threshold for random graphs (2014)
Kohayakawa, Yoshiharu ; Konstadinidis, Pavlos B; Mota, Guilherme Oliveira
Source: European Journal of Combinatorics. Unidade: IME
Subjects: COMBINATÓRIA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e KONSTADINIDIS, Pavlos B e MOTA, Guilherme Oliveira. On an anti-Ramsey threshold for random graphs. European Journal of Combinatorics, v. 40, p. 26-41, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2014.02.004. Acesso em: 03 jan. 2026.
APA
Kohayakawa, Y., Konstadinidis, P. B., & Mota, G. O. (2014). On an anti-Ramsey threshold for random graphs. European Journal of Combinatorics, 40, 26-41. doi:10.1016/j.ejc.2014.02.004
NLM
Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for random graphs [Internet]. European Journal of Combinatorics. 2014 ; 40 26-41.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1016/j.ejc.2014.02.004
Vancouver
Kohayakawa Y, Konstadinidis PB, Mota GO. On an anti-Ramsey threshold for random graphs [Internet]. European Journal of Combinatorics. 2014 ; 40 26-41.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1016/j.ejc.2014.02.004
Trabalho de evento
Powers of Hamilton cycles in pseudorandom graphs (2014)
Allen, Peter; Bottcher, Julia; Hàn, Hiêp; Kohayakawa, Yoshiharu ; Person, Yury
Source: LATIN 2014: theoretical informatics: Proceedings. Conference titles: Latin American on Theoretical Informatics Symposium - LATIN 2014. Unidade: IME
Subjects: ANÁLISE DE ALGORITMOS, COMPUTABILIDADE E COMPLEXIDADE, MATEMÁTICA DISCRETA, ESTRUTURAS DE DADOS, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Powers of Hamilton cycles in pseudorandom graphs. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_31. Acesso em: 03 jan. 2026.
APA
Allen, P., Bottcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2014). Powers of Hamilton cycles in pseudorandom graphs. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_31
NLM
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2026 jan. 03 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Vancouver
Allen P, Bottcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2026 jan. 03 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_31
Artigo de periodico
Upper bounds on probability thresholds for asymmetric Ramsey properties (2014)
Kohayakawa, Yoshiharu ; Schacht, Mathias; Spöhel, Reto
Source: Random Structures & Algorithms. Unidade: IME
Subjects: GRAFOS ALEATÓRIOS, TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e SCHACHT, Mathias e SPÖHEL, Reto. Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Structures & Algorithms, v. 44, n. 1, p. 1-28, 2014Tradução . . Disponível em: https://doi.org/10.1002/rsa.20446. Acesso em: 03 jan. 2026.
APA
Kohayakawa, Y., Schacht, M., & Spöhel, R. (2014). Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Structures & Algorithms, 44( 1), 1-28. doi:10.1002/rsa.20446
NLM
Kohayakawa Y, Schacht M, Spöhel R. Upper bounds on probability thresholds for asymmetric Ramsey properties [Internet]. Random Structures & Algorithms. 2014 ; 44( 1): 1-28.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1002/rsa.20446
Vancouver
Kohayakawa Y, Schacht M, Spöhel R. Upper bounds on probability thresholds for asymmetric Ramsey properties [Internet]. Random Structures & Algorithms. 2014 ; 44( 1): 1-28.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1002/rsa.20446

USP Schools

ReP

Filtros

Authors

Subjects

Non normalized affiliation