Menu

Filtros : "arithmetic progression" Limpar

Filtros

Refine with date range

  • 1

1 - 2 (2 records)

  • Parte de monografia/livro

    On the triangle removal lemma for subgraphs of sparse pseudorandom graphs (2010)

    Kohayakawa, Yoshiharu ; RÖdlt, VojtĚch; Schacht, Mathias; Skokan, Jozef

    Source: An irregular mind. Unidade: IME

    Subjects: MÉTODOS PROBABILÍSTICOS, TEORIA DOS GRAFOS

    Acesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      KOHAYAKAWA, Yoshiharu et al. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. An irregular mind. Tradução . Berlin: Springer, 2010. . Disponível em: https://doi.org/10.1007/978-3-642-14444-8_10. Acesso em: 24 jan. 2026.

    • APA

      Kohayakawa, Y., RÖdlt, V. Ě., Schacht, M., & Skokan, J. (2010). On the triangle removal lemma for subgraphs of sparse pseudorandom graphs. In An irregular mind. Berlin: Springer. doi:10.1007/978-3-642-14444-8_10

    • NLM

      Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2026 jan. 24 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10

    • Vancouver

      Kohayakawa Y, RÖdlt VĚ, Schacht M, Skokan J. On the triangle removal lemma for subgraphs of sparse pseudorandom graphs [Internet]. In: An irregular mind. Berlin: Springer; 2010. [citado 2026 jan. 24 ] Available from: https://doi.org/10.1007/978-3-642-14444-8_10

  • Trabalho de evento

    Efficient testing of hypergraphs (2002)

    Kohayakawa, Yoshiharu ; Nagle, Brendan; Rodl, Vojtech

    Source: Proceedings. Conference titles: Colloquium on Automata, Languages and Programming. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

    Acesso à fonteAcesso à fonteDOIHow to cite
    A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

    • ABNT

      KOHAYAKAWA, Yoshiharu e NAGLE, Brendan e RODL, Vojtech. Efficient testing of hypergraphs. 2002, Anais.. Berlin: Springer, 2002. Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87. Acesso em: 24 jan. 2026.

    • APA

      Kohayakawa, Y., Nagle, B., & Rodl, V. (2002). Efficient testing of hypergraphs. In Proceedings. Berlin: Springer. doi:10.1007/3-540-45465-9_87

    • NLM

      Kohayakawa Y, Nagle B, Rodl V. Efficient testing of hypergraphs [Internet]. Proceedings. 2002 ;[citado 2026 jan. 24 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87

    • Vancouver

      Kohayakawa Y, Nagle B, Rodl V. Efficient testing of hypergraphs [Internet]. Proceedings. 2002 ;[citado 2026 jan. 24 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1007/3-540-45465-9_87
  • 1

1 - 2 (2 records)

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