ReP USP - Resultado da busca

Artigo de periodico
On the query complexity of estimating the distance to hereditary graph properties (2021)
Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno ; Stagni, Henrique
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. On the query complexity of estimating the distance to hereditary graph properties. SIAM Journal on Discrete Mathematics, v. 35, n. 2, p. 1238-1251, 2021Tradução . . Disponível em: https://doi.org/10.1137/19M1283951. Acesso em: 08 jun. 2024.
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2021). On the query complexity of estimating the distance to hereditary graph properties. SIAM Journal on Discrete Mathematics, 35( 2), 1238-1251. doi:10.1137/19M1283951
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. On the query complexity of estimating the distance to hereditary graph properties [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1238-1251.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1137/19M1283951
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. On the query complexity of estimating the distance to hereditary graph properties [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 2): 1238-1251.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1137/19M1283951
Artigo de periodico
Estimating parameters associated with monotone properties (2020)
Hoppen, Carlos ; Kohayakawa, Yoshiharu ; Lang, Richard; Lefmann, Hanno ; Stagni, Henrique
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS PARA PROCESSAMENTO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HOPPEN, Carlos et al. Estimating parameters associated with monotone properties. Combinatorics, Probability & Computing, v. 29, n. 4, p. 616-632, 2020Tradução . . Disponível em: https://doi.org/10.1017/S0963548320000048. Acesso em: 08 jun. 2024.
APA
Hoppen, C., Kohayakawa, Y., Lang, R., Lefmann, H., & Stagni, H. (2020). Estimating parameters associated with monotone properties. Combinatorics, Probability & Computing, 29( 4), 616-632. doi:10.1017/S0963548320000048
NLM
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability & Computing. 2020 ; 29( 4): 616-632.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1017/S0963548320000048
Vancouver
Hoppen C, Kohayakawa Y, Lang R, Lefmann H, Stagni H. Estimating parameters associated with monotone properties [Internet]. Combinatorics, Probability & Computing. 2020 ; 29( 4): 616-632.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1017/S0963548320000048
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: 08 jun. 2024.
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 2024 jun. 08 ] 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 2024 jun. 08 ] Available from: https://doi.org/10.1016/j.jctb.2012.09.003
Artigo de periodico
A note on the size-Ramsey number of long subdivisions of graphs (2005)
Donadelli Junior, Jair; Haxell, Penny E; Kohayakawa, Yoshiharu
Source: Rairo - Theoretical Informatics and Applications, Paris. Unidade: IME
Assunto: SISTEMAS DE INFORMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DONADELLI JUNIOR, Jair e HAXELL, Penny E e KOHAYAKAWA, Yoshiharu. A note on the size-Ramsey number of long subdivisions of graphs. Rairo - Theoretical Informatics and Applications, Paris, v. 39, n. 1, p. 191-206, 2005Tradução . . Disponível em: https://doi.org/10.1051/ita:2005019. Acesso em: 08 jun. 2024.
APA
Donadelli Junior, J., Haxell, P. E., & Kohayakawa, Y. (2005). A note on the size-Ramsey number of long subdivisions of graphs. Rairo - Theoretical Informatics and Applications, Paris, 39( 1), 191-206. doi:10.1051/ita:2005019
NLM
Donadelli Junior J, Haxell PE, Kohayakawa Y. A note on the size-Ramsey number of long subdivisions of graphs [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 191-206.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1051/ita:2005019
Vancouver
Donadelli Junior J, Haxell PE, Kohayakawa Y. A note on the size-Ramsey number of long subdivisions of graphs [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 191-206.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1051/ita:2005019
Artigo de periodico
Packing and covering triangles in tripartite graphs (1998)
Haxell, Penny E.; Kohayakawa, Yoshiharu
Source: Graphs and Combinatorics. Unidade: IME
Assunto: 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. Packing and covering triangles in tripartite graphs. Graphs and Combinatorics, v. 14, n. 1, p. 1-10, 1998Tradução . . Disponível em: https://doi.org/10.1007/s003730050010. Acesso em: 08 jun. 2024.
APA
Haxell, P. E., & Kohayakawa, Y. (1998). Packing and covering triangles in tripartite graphs. Graphs and Combinatorics, 14( 1), 1-10. doi:10.1007/s003730050010
NLM
Haxell PE, Kohayakawa Y. Packing and covering triangles in tripartite graphs [Internet]. Graphs and Combinatorics. 1998 ; 14( 1): 1-10.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1007/s003730050010
Vancouver
Haxell PE, Kohayakawa Y. Packing and covering triangles in tripartite graphs [Internet]. Graphs and Combinatorics. 1998 ; 14( 1): 1-10.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1007/s003730050010
Artigo de periodico
Turán's extremal problem in random graphs: forbidding odd cycles (1996)
Haxell, Penny E; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Combinatorica. 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 e LUCZAK, Tomasz. Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, v. 16, n. 1, p. 107-122, 1996Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129. Acesso em: 08 jun. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1996). Turán's extremal problem in random graphs: forbidding odd cycles. Combinatorica, 16( 1), 107-122. doi:10.1007%2FBF01300129
NLM
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding odd cycles [Internet]. Combinatorica. 1996 ; 16( 1): 107-122.[citado 2024 jun. 08 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. Turán's extremal problem in random graphs: forbidding odd cycles [Internet]. Combinatorica. 1996 ; 16( 1): 107-122.[citado 2024 jun. 08 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/BF01300129
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: 08 jun. 2024.
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 2024 jun. 08 ] 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 2024 jun. 08 ] Available from: https://doi.org/10.1006/jctb.1996.0065
Artigo de periodico
The induced size-Ramsey number of cycles (1995)
Haxell, P E; Kohayakawa, Yoshiharu ; Luczak, T
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAXELL, P E e KOHAYAKAWA, Yoshiharu e LUCZAK, T. The induced size-Ramsey number of cycles. Combinatorics, Probability & Computing, v. 4, n. 3, p. 217-239, 1995Tradução . . Disponível em: https://doi.org/10.1017/S0963548300001619. Acesso em: 08 jun. 2024.
APA
Haxell, P. E., Kohayakawa, Y., & Luczak, T. (1995). The induced size-Ramsey number of cycles. Combinatorics, Probability & Computing, 4( 3), 217-239. doi:10.1017/S0963548300001619
NLM
Haxell PE, Kohayakawa Y, Luczak T. The induced size-Ramsey number of cycles [Internet]. Combinatorics, Probability & Computing. 1995 ; 4( 3): 217-239.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1017/S0963548300001619
Vancouver
Haxell PE, Kohayakawa Y, Luczak T. The induced size-Ramsey number of cycles [Internet]. Combinatorics, Probability & Computing. 1995 ; 4( 3): 217-239.[citado 2024 jun. 08 ] Available from: https://doi.org/10.1017/S0963548300001619
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: 08 jun. 2024.
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 2024 jun. 08 ] 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 2024 jun. 08 ] Available from: https://doi.org/10.1006/jctb.1995.1035

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Funding Agencies

Non normalized affiliation