Filtros : "Financiado pelo MCTI" "2002" Removido: "FILMES FINOS" Limpar

Filtros



Refine with date range


  • Source: Journal of Combinatorial Theory, Ser. A. Unidade: IME

    Assunto: ESTRUTURAS ALGÉBRICAS ORDENADAS (COMBINATÓRIA)

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

      KOHAYAKAWA, Yoshiharu e KREUTER, Bernd. The width of random subsets of boolean lattices. Journal of Combinatorial Theory, Ser. A, v. 100, n. 2, p. 376-386, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2002.3293. Acesso em: 16 nov. 2024.
    • APA

      Kohayakawa, Y., & Kreuter, B. (2002). The width of random subsets of boolean lattices. Journal of Combinatorial Theory, Ser. A, 100( 2), 376-386. doi:10.1006/jcta.2002.3293
    • NLM

      Kohayakawa Y, Kreuter B. The width of random subsets of boolean lattices [Internet]. Journal of Combinatorial Theory, Ser. A. 2002 ; 100( 2): 376-386.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1006/jcta.2002.3293
    • Vancouver

      Kohayakawa Y, Kreuter B. The width of random subsets of boolean lattices [Internet]. Journal of Combinatorial Theory, Ser. A. 2002 ; 100( 2): 376-386.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1006/jcta.2002.3293
  • Source: Electronic Journal of Combinatorics. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      DONADELLI JUNIOR, Jair e KOHAYAKAWA, Yoshiharu. A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, v. 9, n. 1, p. 1-10, 2002Tradução . . Disponível em: https://doi.org/10.37236/1661. Acesso em: 16 nov. 2024.
    • APA

      Donadelli Junior, J., & Kohayakawa, Y. (2002). A density result for random sparse oriented graphs and its relation to a conjecture of woodall. Electronic Journal of Combinatorics, 9( 1), 1-10. doi:10.37236/1661
    • NLM

      Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 nov. 16 ] Available from: https://doi.org/10.37236/1661
    • Vancouver

      Donadelli Junior J, Kohayakawa Y. A density result for random sparse oriented graphs and its relation to a conjecture of woodall [Internet]. Electronic Journal of Combinatorics. 2002 ; 9( 1): 1-10.[citado 2024 nov. 16 ] Available from: https://doi.org/10.37236/1661
  • Source: Journal of Combinatorial Theory. Ser. A. Unidade: IME

    Assunto: TEORIA DOS GRAFOS

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

      KOHAYAKAWA, Yoshiharu e RODL, Vojtech e SKOKAN, Jozef. Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, v. 97, n. 2, p. 307-352, 2002Tradução . . Disponível em: https://doi.org/10.1006/jcta.2001.3217. Acesso em: 16 nov. 2024.
    • APA

      Kohayakawa, Y., Rodl, V., & Skokan, J. (2002). Hypergraphs, quasi-randomness, and conditions for regularity. Journal of Combinatorial Theory. Ser. A, 97( 2), 307-352. doi:10.1006/jcta.2001.3217
    • NLM

      Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1006/jcta.2001.3217
    • Vancouver

      Kohayakawa Y, Rodl V, Skokan J. Hypergraphs, quasi-randomness, and conditions for regularity [Internet]. Journal of Combinatorial Theory. Ser. A. 2002 ; 97( 2): 307-352.[citado 2024 nov. 16 ] Available from: https://doi.org/10.1006/jcta.2001.3217

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