ReP USP - Resultado da busca

Artigo de periodico
The multicolour size-Ramsey number of powers of paths (2020)
Han, Jie ; Jenssen, Matthew ; Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Roberts, Barnaby
Source: Journal of Combinatorial Theory, Series B. 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
HAN, Jie et al. The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, v. 145, p. 359-375, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2020.06.004. Acesso em: 26 nov. 2025.
APA
Han, J., Jenssen, M., Kohayakawa, Y., Mota, G. O., & Roberts, B. (2020). The multicolour size-Ramsey number of powers of paths. Journal of Combinatorial Theory, Series B, 145, 359-375. doi:10.1016/j.jctb.2020.06.004
NLM
Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1016/j.jctb.2020.06.004
Vancouver
Han J, Jenssen M, Kohayakawa Y, Mota GO, Roberts B. The multicolour size-Ramsey number of powers of paths [Internet]. Journal of Combinatorial Theory, Series B. 2020 ; 145 359-375.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1016/j.jctb.2020.06.004
Artigo de periodico
Decomposing highly edge-connected graphs into paths of any given length (2017)
Botler, Fábio Happ ; Mota, Guilherme Oliveira ; Oshiro, Marcio Takashi Iura ; Wakabayashi, Yoshiko
Source: Journal of Combinatorial Theory, Series B. 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
BOTLER, Fábio Happ et al. Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, v. 122, p. 508-542, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2016.07.010. Acesso em: 26 nov. 2025.
APA
Botler, F. H., Mota, G. O., Oshiro, M. T. I., & Wakabayashi, Y. (2017). Decomposing highly edge-connected graphs into paths of any given length. Journal of Combinatorial Theory, Series B, 122, 508-542. doi:10.1016/j.jctb.2016.07.010
NLM
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Vancouver
Botler FH, Mota GO, Oshiro MTI, Wakabayashi Y. Decomposing highly edge-connected graphs into paths of any given length [Internet]. Journal of Combinatorial Theory, Series B. 2017 ; 122 508-542.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1016/j.jctb.2016.07.010
Artigo de periodico
Limits of permutation sequences (2013)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Moreira, Carlos Gustavo; Ráth, Balázs; Sampaio, Rudini Menezes
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATÓRIA, PERMUTAÇÕES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Limits of permutation sequences. Journal of Combinatorial Theory, Series B, v. 103, n. 1, p. 93-113, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.jctb.2012.09.003. Acesso em: 26 nov. 2025.
APA
Hoppen, C., Kohayakawa, Y., Moreira, C. G., Ráth, B., & Sampaio, R. M. (2013). Limits of permutation sequences. Journal of Combinatorial Theory, Series B, 103( 1), 93-113. doi:10.1016/j.jctb.2012.09.003
NLM
Hoppen C, Kohayakawa Y, Moreira CG, Ráth B, Sampaio RM. Limits of permutation sequences [Internet]. Journal of Combinatorial Theory, Series B. 2013 ; 103( 1): 93-113.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1016/j.jctb.2012.09.003
Vancouver
Hoppen C, Kohayakawa Y, Moreira CG, Ráth B, Sampaio RM. Limits of permutation sequences [Internet]. Journal of Combinatorial Theory, Series B. 2013 ; 103( 1): 93-113.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1016/j.jctb.2012.09.003
Artigo de periodico
Partitioning by monochromatic trees (1996)
Haxell, Penny E; Kohayakawa, Yoshiharu
Source: Journal of Combinatorial Theory, Series B. 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
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu. Partitioning by monochromatic trees. Journal of Combinatorial Theory, Series B, v. 68, n. 2, p. 218-222, 1996Tradução . . Disponível em: https://doi.org/10.1006/jctb.1996.0065. Acesso em: 26 nov. 2025.
APA
Haxell, P. E., & Kohayakawa, Y. (1996). Partitioning by monochromatic trees. Journal of Combinatorial Theory, Series B, 68( 2), 218-222. doi:10.1006/jctb.1996.0065
NLM
Haxell PE, Kohayakawa Y. Partitioning by monochromatic trees [Internet]. Journal of Combinatorial Theory, Series B. 1996 ; 68( 2): 218-222.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1006/jctb.1996.0065
Vancouver
Haxell PE, Kohayakawa Y. Partitioning by monochromatic trees [Internet]. Journal of Combinatorial Theory, Series B. 1996 ; 68( 2): 218-222.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1006/jctb.1996.0065
Artigo de periodico
Sparse anti-Ramsey graphs (1995)
Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Sparse anti-Ramsey graphs. Journal of Combinatorial Theory, Series B, v. 63, n. 1, p. 146-152, 1995Tradução . . Disponível em: https://doi.org/10.1006/jctb.1995.1010. Acesso em: 26 nov. 2025.
APA
Kohayakawa, Y., & Luczak, T. (1995). Sparse anti-Ramsey graphs. Journal of Combinatorial Theory, Series B, 63( 1), 146-152. doi:10.1006/jctb.1995.1010
NLM
Kohayakawa Y, Luczak T. Sparse anti-Ramsey graphs [Internet]. Journal of Combinatorial Theory, Series B. 1995 ; 63( 1): 146-152.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1006/jctb.1995.1010
Vancouver
Kohayakawa Y, Luczak T. Sparse anti-Ramsey graphs [Internet]. Journal of Combinatorial Theory, Series B. 1995 ; 63( 1): 146-152.[citado 2025 nov. 26 ] Available from: https://doi.org/10.1006/jctb.1995.1010
Artigo de periodico
Turán's extremal problem in random graphs: forbidding even cycles (1995)
Haxell, Penny E; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Journal of Combinatorial Theory, Series B. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, Penny E e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B, 1995Tradução . . Disponível em: https://doi.org/10.1006/jctb.1995.1035. Acesso em: 26 nov. 2025.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1995). Turán's extremal problem in random graphs: forbidding even cycles. Journal of Combinatorial Theory, Series B. doi:10.1006/jctb.1995.1035
NLM
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding even cycles [Internet]. Journal of Combinatorial Theory, Series B. 1995 ;[citado 2025 nov. 26 ] Available from: https://doi.org/10.1006/jctb.1995.1035
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding even cycles [Internet]. Journal of Combinatorial Theory, Series B. 1995 ;[citado 2025 nov. 26 ] Available from: https://doi.org/10.1006/jctb.1995.1035

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration