ReP USP - Resultado da busca

Artigo de periodico
A note on supersaturated set systems (2016)
Frankl, Peter; Kohayakawa, Yoshiharu ; Rodl, Vojtech
Source: European Journal of Combinatorics. Unidade: IME
Subjects: TEORIA DOS CONJUNTOS, LÓGICA COMBINATÓRIA, COMBINATÓRIA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FRANKL, Peter e KOHAYAKAWA, Yoshiharu e RODL, Vojtech. A note on supersaturated set systems. European Journal of Combinatorics, v. 51, n. Ja 2016, p. 190-199, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2015.03.028. Acesso em: 19 nov. 2024.
APA
Frankl, P., Kohayakawa, Y., & Rodl, V. (2016). A note on supersaturated set systems. European Journal of Combinatorics, 51( Ja 2016), 190-199. doi:10.1016/j.ejc.2015.03.028
NLM
Frankl P, Kohayakawa Y, Rodl V. A note on supersaturated set systems [Internet]. European Journal of Combinatorics. 2016 ; 51( Ja 2016): 190-199.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2015.03.028
Vancouver
Frankl P, Kohayakawa Y, Rodl V. A note on supersaturated set systems [Internet]. European Journal of Combinatorics. 2016 ; 51( Ja 2016): 190-199.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2015.03.028
Artigo de periodico
The number of B3-sets of a given cardinality (2016)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rödl, Vojtěch; Samotij, Wojciech
Source: Journal of Combinatorial Theory, Series A. Unidade: IME
Subjects: ANÁLISE HARMÔNICA, SÉRIES, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. The number of B3-sets of a given cardinality. Journal of Combinatorial Theory, Series A, v. 142, p. 44-76, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.jcta.2016.03.004. Acesso em: 19 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rödl, V., & Samotij, W. (2016). The number of B3-sets of a given cardinality. Journal of Combinatorial Theory, Series A, 142, 44-76. doi:10.1016/j.jcta.2016.03.004
NLM
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality [Internet]. Journal of Combinatorial Theory, Series A. 2016 ; 142 44-76.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jcta.2016.03.004
Vancouver
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rödl V, Samotij W. The number of B3-sets of a given cardinality [Internet]. Journal of Combinatorial Theory, Series A. 2016 ; 142 44-76.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.jcta.2016.03.004
Artigo de periodico
On the number of Bh-Sets (2016)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Lee, Sang June; Rodl, Vojtech; Samotij, Wojciech
Source: Combinatorics, Probability & Computing. Unidade: IME
Subjects: TEORIA DOS NÚMEROS, SEQUÊNCIAS, COMBINATÓRIA, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DELLAMONICA JUNIOR, Domingos et al. On the number of Bh-Sets. Combinatorics, Probability & Computing, v. 25, n. Ja 2016, p. 108-129, 2016Tradução . . Disponível em: https://doi.org/10.1017/S0963548315000206. Acesso em: 19 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Lee, S. J., Rodl, V., & Samotij, W. (2016). On the number of Bh-Sets. Combinatorics, Probability & Computing, 25( Ja 2016), 108-129. doi:10.1017/S0963548315000206
NLM
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1017/S0963548315000206
Vancouver
Dellamonica Junior D, Kohayakawa Y, Lee SJ, Rodl V, Samotij W. On the number of Bh-Sets [Internet]. Combinatorics, Probability & Computing. 2016 ; 25( Ja 2016): 108-129.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1017/S0963548315000206
Artigo de periodico
Tight Hamilton cycles in random hypergraphs (2015)
Allen, Peter; Boettcher, Julia; Kohayakawa, Yoshiharu ; Person, Yury
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Tight Hamilton cycles in random hypergraphs. Random Structures & Algorithms, v. 46, n. 3, p. 446-465, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20519. Acesso em: 19 nov. 2024.
APA
Allen, P., Boettcher, J., Kohayakawa, Y., & Person, Y. (2015). Tight Hamilton cycles in random hypergraphs. Random Structures & Algorithms, 46( 3), 446-465. doi:10.1002/rsa.20519
NLM
Allen P, Boettcher J, Kohayakawa Y, Person Y. Tight Hamilton cycles in random hypergraphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 3): 446-465.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20519
Vancouver
Allen P, Boettcher J, Kohayakawa Y, Person Y. Tight Hamilton cycles in random hypergraphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 3): 446-465.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20519
Artigo de periodico
An extension of the blow-up lemma to arrangeable graphs (2015)
Boettcher, Julia; Kohayakawa, Yoshiharu ; Taraz, Anusch; Wuerfl, Andreas
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA, GRAFOS ALEATÓRIOS, MÉTODOS PROBABILÍSTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOETTCHER, Julia et al. An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, v. 29, n. 2, p. 962-1001, 2015Tradução . . Disponível em: https://doi.org/10.1137/13093827X. Acesso em: 19 nov. 2024.
APA
Boettcher, J., Kohayakawa, Y., Taraz, A., & Wuerfl, A. (2015). An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29( 2), 962-1001. doi:10.1137/13093827X
NLM
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1137/13093827X
Vancouver
Boettcher J, Kohayakawa Y, Taraz A, Wuerfl A. An extension of the blow-up lemma to arrangeable graphs [Internet]. SIAM Journal on Discrete Mathematics. 2015 ; 29( 2): 962-1001.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1137/13093827X
Artigo de periodico
The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers (2015)
Kohayakawa, Yoshiharu ; Lee, Sang June; Roedl, Vojtech; Samotij, Wojciech
Source: Random Structures & Algorithms. Unidade: IME
Subjects: COMBINATÓRIA, ANÁLISE HARMÔNICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu et al. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Structures & Algorithms, v. 46, n. 1, p. 1-25, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20496. Acesso em: 19 nov. 2024.
APA
Kohayakawa, Y., Lee, S. J., Roedl, V., & Samotij, W. (2015). The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Structures & Algorithms, 46( 1), 1-25. doi:10.1002/rsa.20496
NLM
Kohayakawa Y, Lee SJ, Roedl V, Samotij W. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers [Internet]. Random Structures & Algorithms. 2015 ; 46( 1): 1-25.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20496
Vancouver
Kohayakawa Y, Lee SJ, Roedl V, Samotij W. The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers [Internet]. Random Structures & Algorithms. 2015 ; 46( 1): 1-25.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20496
Artigo de periodico
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (2015)
Hoppen, Carlos; Kohayakawa, Yoshiharu ; Lefmann, Hanno
Source: Discrete Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
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 uniform hypergraphs avoiding monochromatic matchings. Discrete Mathematics, v. 338, n. 2, p. 262-271, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2014.10.004. Acesso em: 19 nov. 2024.
APA
Hoppen, C., Kohayakawa, Y., & Lefmann, H. (2015). Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. Discrete Mathematics, 338( 2), 262-271. doi:10.1016/j.disc.2014.10.004
NLM
Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of uniform hypergraphs avoiding monochromatic matchings [Internet]. Discrete Mathematics. 2015 ; 338( 2): 262-271.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.disc.2014.10.004
Vancouver
Hoppen C, Kohayakawa Y, Lefmann H. Edge-colorings of uniform hypergraphs avoiding monochromatic matchings [Internet]. Discrete Mathematics. 2015 ; 338( 2): 262-271.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.disc.2014.10.004
Artigo de periodico
An improved upper bound on the density of universal random graphs (2015)
Dellamonica Junior, Domingos; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Rucinski, Andrzej
Source: Random Structures & Algorithms. 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
DELLAMONICA JUNIOR, Domingos et al. An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, v. 46, n. 2, p. 274-299, 2015Tradução . . Disponível em: https://doi.org/10.1002/rsa.20545. Acesso em: 19 nov. 2024.
APA
Dellamonica Junior, D., Kohayakawa, Y., Rodl, V., & Rucinski, A. (2015). An improved upper bound on the density of universal random graphs. Random Structures & Algorithms, 46( 2), 274-299. doi:10.1002/rsa.20545
NLM
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20545
Vancouver
Dellamonica Junior D, Kohayakawa Y, Rodl V, Rucinski A. An improved upper bound on the density of universal random graphs [Internet]. Random Structures & Algorithms. 2015 ; 46( 2): 274-299.[citado 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20545
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: 19 nov. 2024. , 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 2024 nov. 19 ] 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 2024 nov. 19 ] Available from: https://doi.org/10.1016/j.ejc.2013.06.027
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: 19 nov. 2024.
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 2024 nov. 19 ] 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 2024 nov. 19 ] 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: 19 nov. 2024.
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 2024 nov. 19 ] 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 2024 nov. 19 ] 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: 19 nov. 2024.
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 2024 nov. 19 ] 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 2024 nov. 19 ] Available from: https://doi.org/10.1002/rsa.20446

USP Schools

ReP

Filtros

Authors

Subjects

Source title

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration