ReP USP - Resultado da busca

Artigo de periodico
Counting results for sparse pseudorandom hypergraphs I (2017)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
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
KOHAYAKAWA, Yoshiharu et al. Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics, v. 65, p. 276-287, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2017.04.008. Acesso em: 26 set. 2024.
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2017). Counting results for sparse pseudorandom hypergraphs I. European Journal of Combinatorics, 65, 276-287. doi:10.1016/j.ejc.2017.04.008
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs I [Internet]. European Journal of Combinatorics. 2017 ; 65 276-287.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.008
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs I [Internet]. European Journal of Combinatorics. 2017 ; 65 276-287.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.008
Artigo de periodico
Counting results for sparse pseudorandom hypergraphs II (2017)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
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
KOHAYAKAWA, Yoshiharu et al. Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics, v. 65, p. 288-301, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejc.2017.04.007. Acesso em: 26 set. 2024.
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2017). Counting results for sparse pseudorandom hypergraphs II. European Journal of Combinatorics, 65, 288-301. doi:10.1016/j.ejc.2017.04.007
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs II [Internet]. European Journal of Combinatorics. 2017 ; 65 288-301.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.007
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. Counting results for sparse pseudorandom hypergraphs II [Internet]. European Journal of Combinatorics. 2017 ; 65 288-301.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.ejc.2017.04.007
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: 26 set. 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 set. 26 ] 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 set. 26 ] Available from: https://doi.org/10.1137/13093827X
Trabalho de evento-anais periodico
A counting lemma for sparse pseudorandom hypergraphs (2015)
Kohayakawa, Yoshiharu ; Mota, Guilherme Oliveira ; Schacht, Mathias; Taraz, Anusch
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. 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
KOHAYAKAWA, Yoshiharu et al. A counting lemma for sparse pseudorandom hypergraphs. 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.2015.07.070. Acesso em: 26 set. 2024. , 2015
APA
Kohayakawa, Y., Mota, G. O., Schacht, M., & Taraz, A. (2015). A counting lemma for sparse pseudorandom hypergraphs. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.070
NLM
Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070
Vancouver
Kohayakawa Y, Mota GO, Schacht M, Taraz A. A counting lemma for sparse pseudorandom hypergraphs [Internet]. Electronic Notes in Discrete Mathematics. 2015 ; 50 421-426.[citado 2024 set. 26 ] Available from: https://doi.org/10.1016/j.endm.2015.07.070
Artigo de periodico
Almost spanning subgraphs of random graphs after adversarial edge removal (2013)
Bottcher, Julia; Kohayakawa, Yoshiharu ; Taraz, Anusch
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
BOTTCHER, Julia e KOHAYAKAWA, Yoshiharu e TARAZ, Anusch. Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability & Computing, v. 22, n. 5, p. 639-683, 2013Tradução . . Disponível em: https://doi.org/10.1017/S0963548313000199. Acesso em: 26 set. 2024.
APA
Bottcher, J., Kohayakawa, Y., & Taraz, A. (2013). Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability & Computing, 22( 5), 639-683. doi:10.1017/S0963548313000199
NLM
Bottcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Combinatorics, Probability & Computing. 2013 ; 22( 5): 639-683.[citado 2024 set. 26 ] Available from: https://doi.org/10.1017/S0963548313000199
Vancouver
Bottcher J, Kohayakawa Y, Taraz A. Almost spanning subgraphs of random graphs after adversarial edge removal [Internet]. Combinatorics, Probability & Computing. 2013 ; 22( 5): 639-683.[citado 2024 set. 26 ] Available from: https://doi.org/10.1017/S0963548313000199
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: 26 set. 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 set. 26 ] 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 set. 26 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055
Artigo de periodico
Essentially infinite colourings of hypergraphs (2007)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Taraz, Anusch
Source: Proceedings of the London Mathematical Society. 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
BOLLOBÁS, Béla et al. Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 709-734, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm024. Acesso em: 26 set. 2024.
APA
Bollobás, B., Kohayakawa, Y., Rodl, V., Schacht, M., & Taraz, A. (2007). Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, 95( 3), 709-734. doi:10.1112/plms/pdm024
NLM
Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 set. 26 ] Available from: https://doi.org/10.1112/plms/pdm024
Vancouver
Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 set. 26 ] Available from: https://doi.org/10.1112/plms/pdm024

USP Schools

ReP

Filtros

Authors

Funding Agencies

Non normalized affiliation