ReP USP - Resultado da busca

Artigo de periodico
Degree conditions for Ramsey goodness of paths (2025)
Aragão, Lucas; Marciano, João Pedro; Mendonça, Walner
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
ARAGÃO, Lucas e MARCIANO, João Pedro e MENDONÇA, Walner. Degree conditions for Ramsey goodness of paths. European Journal of Combinatorics, v. 124, n. article 104082, p. 1-12, 2025Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2024.104082. Acesso em: 03 dez. 2025.
APA
Aragão, L., Marciano, J. P., & Mendonça, W. (2025). Degree conditions for Ramsey goodness of paths. European Journal of Combinatorics, 124( article 104082), 1-12. doi:10.1016/j.ejc.2024.104082
NLM
Aragão L, Marciano JP, Mendonça W. Degree conditions for Ramsey goodness of paths [Internet]. European Journal of Combinatorics. 2025 ;124( article 104082): 1-12.[citado 2025 dez. 03 ] Available from: https://doi.org/10.1016/j.ejc.2024.104082
Vancouver
Aragão L, Marciano JP, Mendonça W. Degree conditions for Ramsey goodness of paths [Internet]. European Journal of Combinatorics. 2025 ;124( article 104082): 1-12.[citado 2025 dez. 03 ] Available from: https://doi.org/10.1016/j.ejc.2024.104082
Trabalho de evento-resumo
Rainbow path covers of sparse random graphs (extended abstract) (2025)
Botler, Fábio Happ ; Kaique, Antônio; Mendonça, Walner ; Mota, G.O; Sato, C M
Source: Proceedings - Booklet of extended abstracts. 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
BOTLER, Fábio Happ et al. Rainbow path covers of sparse random graphs (extended abstract). 2025, Anais.. Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics, 2025. p. 168-173. Disponível em: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf. Acesso em: 03 dez. 2025.
APA
Botler, F. H., Kaique, A., Mendonça, W., Mota, G. O., & Sato, C. M. (2025). Rainbow path covers of sparse random graphs (extended abstract). In Proceedings - Booklet of extended abstracts (p. 168-173). Budapeste: HUN-REN Alfréd Rényi Institute of Mathematics. Recuperado de https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
NLM
Botler FH, Kaique A, Mendonça W, Mota GO, Sato CM. Rainbow path covers of sparse random graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 168-173.[citado 2025 dez. 03 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
Vancouver
Botler FH, Kaique A, Mendonça W, Mota GO, Sato CM. Rainbow path covers of sparse random graphs (extended abstract) [Internet]. Proceedings - Booklet of extended abstracts. 2025 ; 168-173.[citado 2025 dez. 03 ] Available from: https://repositorio.usp.br/directbitstream/4cee253e-d4d3-4de2-910f-b1e64c8b77da/3271549.pdf
Artigo de periodico
On the anti-Ramsey threshold for non-balanced graphs (2024)
Araújo, Pedro; Martins, Taísa ; Mattos, Letícia; Mendonça, Walner ; Moreira, Luiz; Mota, Guilherme Oliveira
Source: The Electronic Journal of Combinatorics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARAÚJO, Pedro et al. On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, v. 31, n. 1, p. 1-21, 2024Tradução . . Disponível em: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70. Acesso em: 03 dez. 2025.
APA
Araújo, P., Martins, T., Mattos, L., Mendonça, W., Moreira, L., & Mota, G. O. (2024). On the anti-Ramsey threshold for non-balanced graphs. The Electronic Journal of Combinatorics, 31( 1), 1-21. Recuperado de https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
NLM
Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2025 dez. 03 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
Vancouver
Araújo P, Martins T, Mattos L, Mendonça W, Moreira L, Mota GO. On the anti-Ramsey threshold for non-balanced graphs [Internet]. The Electronic Journal of Combinatorics. 2024 ; 31( 1): 1-21.[citado 2025 dez. 03 ] Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v31i1p70
Artigo de periodico
Tiling edge-coloured graphs with few monochromatic bounded-degree graphs (2024)
Corsten, Jan; Mendonça, Walner
Source: Combinatorica. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CORSTEN, Jan e MENDONÇA, Walner. Tiling edge-coloured graphs with few monochromatic bounded-degree graphs. Combinatorica, v. 44, p. 311-335, 2024Tradução . . Disponível em: https://doi.org/10.1007/s00493-023-00072-1. Acesso em: 03 dez. 2025.
APA
Corsten, J., & Mendonça, W. (2024). Tiling edge-coloured graphs with few monochromatic bounded-degree graphs. Combinatorica, 44, 311-335. doi:10.1007/s00493-023-00072-1
NLM
Corsten J, Mendonça W. Tiling edge-coloured graphs with few monochromatic bounded-degree graphs [Internet]. Combinatorica. 2024 ; 44 311-335.[citado 2025 dez. 03 ] Available from: https://doi.org/10.1007/s00493-023-00072-1
Vancouver
Corsten J, Mendonça W. Tiling edge-coloured graphs with few monochromatic bounded-degree graphs [Internet]. Combinatorica. 2024 ; 44 311-335.[citado 2025 dez. 03 ] Available from: https://doi.org/10.1007/s00493-023-00072-1
Monografia/livro
Combinatória (2022)
Botler, Fábio Happ ; Collares, Maurício ; Martins, Taísa ; Mendonça, Walner ; Mota, Guilherme Oliveira
Conference titles: Colóquio Brasileiro de Matemática. Unidade: IME
Subjects: COMBINATÓRIA PROBABILÍSTICA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOTLER, Fábio Happ et al. Combinatória. . Rio de Janeiro: Impa. Disponível em: https://impa.br/wp-content/uploads/2022/01/33CBM02-eBook.pdf. Acesso em: 03 dez. 2025. , 2022
APA
Botler, F. H., Collares, M., Martins, T., Mendonça, W., & Mota, G. O. (2022). Combinatória. Rio de Janeiro: Impa. Recuperado de https://impa.br/wp-content/uploads/2022/01/33CBM02-eBook.pdf
NLM
Botler FH, Collares M, Martins T, Mendonça W, Mota GO. Combinatória [Internet]. 2022 ;[citado 2025 dez. 03 ] Available from: https://impa.br/wp-content/uploads/2022/01/33CBM02-eBook.pdf
Vancouver
Botler FH, Collares M, Martins T, Mendonça W, Mota GO. Combinatória [Internet]. 2022 ;[citado 2025 dez. 03 ] Available from: https://impa.br/wp-content/uploads/2022/01/33CBM02-eBook.pdf
Artigo de periodico
Covering 3-edge-colored random graphs with monochromatic trees (2021)
Kohayakawa, Yoshiharu ; Mendonça, Walner ; Mota, Guilherme Oliveira ; Schülke, Bjarne
Source: SIAM Journal on Discrete Mathematics. 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. Covering 3-edge-colored random graphs with monochromatic trees. SIAM Journal on Discrete Mathematics, v. 35, n. 2, p. 1447-1459, 2021Tradução . . Disponível em: https://doi.org/10.1137/20M137464X. Acesso em: 03 dez. 2025.
APA
Kohayakawa, Y., Mendonça, W., Mota, G. O., & Schülke, B. (2021). Covering 3-edge-colored random graphs with monochromatic trees. SIAM Journal on Discrete Mathematics, 35( 2), 1447-1459. doi:10.1137/20M137464X
NLM
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-edge-colored random graphs with monochromatic trees [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1447-1459.[citado 2025 dez. 03 ] Available from: https://doi.org/10.1137/20M137464X
Vancouver
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-edge-colored random graphs with monochromatic trees [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1447-1459.[citado 2025 dez. 03 ] Available from: https://doi.org/10.1137/20M137464X
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: 03 dez. 2025.
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 2025 dez. 03 ] 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 2025 dez. 03 ] Available from: https://doi.org/10.1112/jlms.12408
Artigo de periodico
Covering 3-coloured random graphs with monochromatic trees (2019)
Kohayakawa, Yoshiharu ; Mendonça, Walner; Mota, Guilherme Oliveira ; Schülke, Bjarne
Source: Acta mathematica universitatis comenianae. 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
KOHAYAKAWA, Yoshiharu et al. Covering 3-coloured random graphs with monochromatic trees. Acta mathematica universitatis comenianae, v. 88, n. 3, p. 871-875, 2019Tradução . . Disponível em: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310. Acesso em: 03 dez. 2025.
APA
Kohayakawa, Y., Mendonça, W., Mota, G. O., & Schülke, B. (2019). Covering 3-coloured random graphs with monochromatic trees. Acta mathematica universitatis comenianae, 88( 3), 871-875. Recuperado de http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310
NLM
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-coloured random graphs with monochromatic trees [Internet]. Acta mathematica universitatis comenianae. 2019 ; 88( 3): 871-875.[citado 2025 dez. 03 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310
Vancouver
Kohayakawa Y, Mendonça W, Mota GO, Schülke B. Covering 3-coloured random graphs with monochromatic trees [Internet]. Acta mathematica universitatis comenianae. 2019 ; 88( 3): 871-875.[citado 2025 dez. 03 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1310
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: 03 dez. 2025. , 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 2025 dez. 03 ] 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 2025 dez. 03 ] Available from: http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1281

USP Schools

ReP

Filtros

Authors

Source title

Publisher

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration