메뉴 건너뛰기




Volumn 235, Issue 1-3, 2001, Pages 271-290

The asymptotic number of triple systems not containing a fixed one

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0035962919     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00280-6     Document Type: Article
Times cited : (27)

References (13)
  • 1
    • 84961489991 scopus 로고
    • On the entropy values of hereditary classes of graphs
    • V.E. Alekseev, On the entropy values of hereditary classes of graphs, Discrete Math. Appl. 3 (1993) 191-199.
    • (1993) Discrete Math. Appl. , vol.3 , pp. 191-199
    • Alekseev, V.E.1
  • 4
    • 51249165384 scopus 로고
    • On extremal problems of graphs and generalized graphs
    • P. Erdos, On extremal problems of graphs and generalized graphs, Israel J. Math. 2 (1965) 189-190.
    • (1965) Israel J. Math. , vol.2 , pp. 189-190
    • Erdos, P.1
  • 5
    • 0011319584 scopus 로고
    • The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs have no exponent
    • P. Erdos, P. Frankl, V. Rödl, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs have no exponent, Graphs Combin. 2 (1986) 113-121.
    • (1986) Graphs Combin. , vol.2 , pp. 113-121
    • Erdos, P.1    Frankl, P.2    Rödl, V.3
  • 6
  • 8
    • 0011575409 scopus 로고
    • The asymptotic number of lattices
    • J. Shrivastava (Ed.), Combinatorial Mathematics, Optimal Designs and their Applications, North-Holland, Amsterdam
    • D.J. Kleitman, K.J. Winston, The asymptotic number of lattices, in: J. Shrivastava (Ed.), Combinatorial Mathematics, Optimal Designs and their Applications, Ann. Discrete Math., Vol. 6, North-Holland, Amsterdam, 1980, pp. 243-249.
    • (1980) Ann. Discrete Math. , vol.6 , pp. 243-249
    • Kleitman, D.J.1    Winston, K.J.2
  • 10
    • 0000501688 scopus 로고    scopus 로고
    • Szemerédi's Regularity Lemma and its application in graph theory
    • D. Miklós, V.T. Sós, and T. Szönyi (Eds.), János Bolyai Mathematical Society, Budapest, Hungary
    • J. Komlós, M. Simonovits, Szemerédi's Regularity Lemma and its application in graph theory, in: D. Miklós, V.T. Sós, and T. Szönyi (Eds.), Combinatorics, Paul Erdös is eighty, Vol. 2, János Bolyai Mathematical Society, Budapest, Hungary, 1996, pp. 295-352.
    • (1996) Combinatorics, Paul Erdös Is Eighty , vol.2 , pp. 295-352
    • Komlós, J.1    Simonovits, M.2
  • 13
    • 0001263144 scopus 로고
    • An extremal problem in graph theory
    • (in Hungarian)
    • P. Turán, An extremal problem in graph theory, Mat. Fiz. Lapok 48 (1941) 436-452 (in Hungarian).
    • (1941) Mat. Fiz. Lapok , vol.48 , pp. 436-452
    • Turán, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.