Menu

Filtros : "Böttcher, Julia" "Böttcher, Julia" "Electronic Notes in Discrete Mathematics" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 14 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. 14 ] 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. 14 ] Available from: https://doi.org/10.1016/j.endm.2013.10.061

  • 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

    PrivadoAcesso à fonteDOIHow to cite
    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: 14 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. 14 ] 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. 14 ] Available from: https://doi.org/10.1016/j.endm.2009.11.055
  • 1

1 - 2 (2 records)

Digital Library of Intellectual Production of Universidade de São Paulo     2012 - 2024