ReP USP - Resultado da busca

Artigo de periodico
The anti-Ramsey threshold of complete graphs (2023)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Parczyk, Olaf ; Schnitzer, Jakob
Source: Discrete Mathematics. 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 et al. The anti-Ramsey threshold of complete graphs. Discrete Mathematics, v. 346, n. 5, p. 1-12, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2023.113343. Acesso em: 09 jun. 2024.
APA
Kohayakawa, Y., Mota, G. O., Parczyk, O., & Schnitzer, J. (2023). The anti-Ramsey threshold of complete graphs. Discrete Mathematics, 346( 5), 1-12. doi:10.1016/j.disc.2023.113343
NLM
Kohayakawa Y, Mota GO, Parczyk O, Schnitzer J. The anti-Ramsey threshold of complete graphs [Internet]. Discrete Mathematics. 2023 ; 346( 5): 1-12.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1016/j.disc.2023.113343
Vancouver
Kohayakawa Y, Mota GO, Parczyk O, Schnitzer J. The anti-Ramsey threshold of complete graphs [Internet]. Discrete Mathematics. 2023 ; 346( 5): 1-12.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1016/j.disc.2023.113343
Trabalho de evento-anais periodico
Anti-Ramsey threshold of cycles (2022)
Barros, Gabriel Ferreira; Cavalar, Bruno Pasqualotto ; Mota, Guilherme Oliveira ; Parczyk, Olaf
Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BARROS, Gabriel Ferreira et al. Anti-Ramsey threshold of cycles. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.dam.2021.10.021. Acesso em: 09 jun. 2024. , 2022
APA
Barros, G. F., Cavalar, B. P., Mota, G. O., & Parczyk, O. (2022). Anti-Ramsey threshold of cycles. Discrete Applied Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.dam.2021.10.021
NLM
Barros GF, Cavalar BP, Mota GO, Parczyk O. Anti-Ramsey threshold of cycles [Internet]. Discrete Applied Mathematics. 2022 ; 323 228-235.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1016/j.dam.2021.10.021
Vancouver
Barros GF, Cavalar BP, Mota GO, Parczyk O. Anti-Ramsey threshold of cycles [Internet]. Discrete Applied Mathematics. 2022 ; 323 228-235.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1016/j.dam.2021.10.021
Artigo de periodico
The size-Ramsey number of powers of bounded degree trees (2021)
Berger, Sören; Kohayakawa, Yoshiharu ; Maesaka, Giulia Satiko; Martins, Taísa ; Mendonça, Walner; Mota, Guilherme Oliveira ; Parczyk, Olaf
Source: Journal of the London Mathematical Society. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BERGER, Sören et al. The size-Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, v. 103, n. 4, p. 1314-1332, 2021Tradução . . Disponível em: https://doi.org/10.1112/jlms.12408. Acesso em: 09 jun. 2024.
APA
Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., & Parczyk, O. (2021). The size-Ramsey number of powers of bounded degree trees. Journal of the London Mathematical Society, 103( 4), 1314-1332. doi:10.1112/jlms.12408
NLM
Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Journal of the London Mathematical Society. 2021 ; 103( 4): 1314-1332.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1112/jlms.12408
Vancouver
Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Journal of the London Mathematical Society. 2021 ; 103( 4): 1314-1332.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1112/jlms.12408
Artigo de periodico
Universality for bounded degree spanning trees in randomly perturbed graphs (2019)
Böttcher, Julia; Han, Jie ; Kohayakawa, Yoshiharu ; Montgomery, Richard ; Parczyk, Olaf ; Person, Yury
Source: Random Structures & Algorithms. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BÖTTCHER, Julia et al. Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, v. 55, n. 4, p. 854-864, 2019Tradução . . Disponível em: https://doi.org/10.1002/rsa.20850. Acesso em: 09 jun. 2024.
APA
Böttcher, J., Han, J., Kohayakawa, Y., Montgomery, R., Parczyk, O., & Person, Y. (2019). Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures & Algorithms, 55( 4), 854-864. doi:10.1002/rsa.20850
NLM
Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1002/rsa.20850
Vancouver
Böttcher J, Han J, Kohayakawa Y, Montgomery R, Parczyk O, Person Y. Universality for bounded degree spanning trees in randomly perturbed graphs [Internet]. Random Structures & Algorithms. 2019 ; 55( 4): 854-864.[citado 2024 jun. 09 ] Available from: https://doi.org/10.1002/rsa.20850
Trabalho de evento-anais periodico
The size-Ramsey number of powers of bounded degree trees (2019)
Berger, Sören; Kohayakawa, Yoshiharu ; Maesaka, Giulia Satiko ; Martins, Taísa ; Mendonça, Walner; Mota, Guilherme Oliveira ; Parczyk, Olaf
Source: Acta mathematica Universitatis Comenianae. 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
BERGER, Sören et al. The size-Ramsey number of powers of bounded degree trees. Acta mathematica Universitatis Comenianae. Bratislava: Bratislava Ústav aplikovanej matematiky Fakulty matematiky, fyziky a informatiky Univerzity Komenského. Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281. Acesso em: 09 jun. 2024. , 2019
APA
Berger, S., Kohayakawa, Y., Maesaka, G. S., Martins, T., Mendonça, W., Mota, G. O., & Parczyk, O. (2019). The size-Ramsey number of powers of bounded degree trees. Acta mathematica Universitatis Comenianae. Bratislava: Bratislava Ústav aplikovanej matematiky Fakulty matematiky, fyziky a informatiky Univerzity Komenského. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281
NLM
Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Acta mathematica Universitatis Comenianae. 2019 ; 88( 3): 451-456.[citado 2024 jun. 09 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281
Vancouver
Berger S, Kohayakawa Y, Maesaka GS, Martins T, Mendonça W, Mota GO, Parczyk O. The size-Ramsey number of powers of bounded degree trees [Internet]. Acta mathematica Universitatis Comenianae. 2019 ; 88( 3): 451-456.[citado 2024 jun. 09 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation