ReP USP - Resultado da busca

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: 01 nov. 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 nov. 01 ] 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 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20850
Artigo de periodico
Chromatic thresholds in dense random graphs (2017)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in dense random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 185-214, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20708. Acesso em: 01 nov. 2024.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in dense random graphs. Random Structures & Algorithms, 51( 2), 185-214. doi:10.1002/rsa.20708
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20708
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in dense random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 185-214.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20708
Artigo de periodico
Powers of Hamilton cycles in pseudorandom graphs (2017)
Allen, Peter; Böttcher, Julia; Hàn, Hiệp; Kohayakawa, Yoshiharu ; Person, Yury
Source: Combinatorica. 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
ALLEN, Peter et al. Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, v. 37, n. 4, p. 573-616, 2017Tradução . . Disponível em: https://doi.org/10.1007/s00493-015-3228-2. Acesso em: 01 nov. 2024.
APA
Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2017). Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, 37( 4), 573-616. doi:10.1007/s00493-015-3228-2
NLM
Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. Combinatorica. 2017 ; 37( 4): 573-616.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1007/s00493-015-3228-2
Vancouver
Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. Powers of Hamilton cycles in pseudorandom graphs [Internet]. Combinatorica. 2017 ; 37( 4): 573-616.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1007/s00493-015-3228-2
Artigo de periodico
Chromatic thresholds in sparse random graphs (2017)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA PROBABILÍSTICA, GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, v. 51, n. 2, p. 215–236, 2017Tradução . . Disponível em: https://doi.org/10.1002/rsa.20709. Acesso em: 01 nov. 2024.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2017). Chromatic thresholds in sparse random graphs. Random Structures & Algorithms, 51( 2), 215–236. doi:10.1002/rsa.20709
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in sparse random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 215–236.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20709
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. Chromatic thresholds in sparse random graphs [Internet]. Random Structures & Algorithms. 2017 ; 51( 2): 215–236.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20709
Trabalho de evento-anais periodico
An approximate blow-up lemma for sparse pseudorandom graphs (2013)
Allen, Peter ; Böttcher, Julia ; Hàn, Hiêp; Kohayakawa, Yoshiharu ; Person, Yury
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs, and Optimization Symposium - LAGOS. Unidade: IME
Assunto: GRAFOS ALEATÓRIOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ALLEN, Peter et al. An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2013.10.061. Acesso em: 01 nov. 2024. , 2013
APA
Allen, P., Böttcher, J., Hàn, H., Kohayakawa, Y., & Person, Y. (2013). An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2013.10.061
NLM
Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. An approximate blow-up lemma for sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 44 393-398.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061
Vancouver
Allen P, Böttcher J, Hàn H, Kohayakawa Y, Person Y. An approximate blow-up lemma for sparse pseudorandom graphs [Internet]. Electronic Notes in Discrete Mathematics. 2013 ; 44 393-398.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061
Artigo de periodico
The chromatic thresholds of graphs (2013)
Allen, Peter; Böttcher, Julia; Griffiths, Simon; Kohayakawa, Yoshiharu ; Morris, Robert
Source: Advances in Mathematics. 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
ALLEN, Peter et al. The chromatic thresholds of graphs. Advances in Mathematics, v. 235, p. 261-295, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.aim.2012.11.016. Acesso em: 01 nov. 2024.
APA
Allen, P., Böttcher, J., Griffiths, S., Kohayakawa, Y., & Morris, R. (2013). The chromatic thresholds of graphs. Advances in Mathematics, 235, 261-295. doi:10.1016/j.aim.2012.11.016
NLM
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. The chromatic thresholds of graphs [Internet]. Advances in Mathematics. 2013 ; 235 261-295.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1016/j.aim.2012.11.016
Vancouver
Allen P, Böttcher J, Griffiths S, Kohayakawa Y, Morris R. The chromatic thresholds of graphs [Internet]. Advances in Mathematics. 2013 ; 235 261-295.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1016/j.aim.2012.11.016
Artigo de periodico
Properly coloured copies and rainbow copies of large graphs with small maximum degree (2012)
Böttcher, Julia; Kohayakawa, Yoshiharu ; Procacci, Aldo
Source: Random Structures and Algorithms. Unidade: IME
Assunto: TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BÖTTCHER, Julia e KOHAYAKAWA, Yoshiharu e PROCACCI, Aldo. Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, v. 40, n. 4, p. 425-436, 2012Tradução . . Disponível em: https://doi.org/10.1002/rsa.20383. Acesso em: 01 nov. 2024.
APA
Böttcher, J., Kohayakawa, Y., & Procacci, A. (2012). Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, 40( 4), 425-436. doi:10.1002/rsa.20383
NLM
Böttcher J, Kohayakawa Y, Procacci A. Properly coloured copies and rainbow copies of large graphs with small maximum degree [Internet]. Random Structures and Algorithms. 2012 ; 40( 4): 425-436.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20383
Vancouver
Böttcher J, Kohayakawa Y, Procacci A. Properly coloured copies and rainbow copies of large graphs with small maximum degree [Internet]. Random Structures and Algorithms. 2012 ; 40( 4): 425-436.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1002/rsa.20383
Trabalho de evento-anais periodico
Almost spanning subgraphs of random graphs after adversarial edge removal (2009)
Böttcher, Julia ; Kohayakawa, Yoshiharu ; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. 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 e KOHAYAKAWA, Yoshiharu e TARAZ, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2009.11.055. Acesso em: 01 nov. 2024. , 2009
APA
Böttcher, J., Kohayakawa, Y., & Taraz, A. (2009). Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2009.11.055
NLM
Böttcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 335-340.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055
Vancouver
Böttcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Electronic Notes in Discrete Mathematics. 2009 ; 35 335-340.[citado 2024 nov. 01 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation