메뉴 건너뛰기
Discrete Mathematics
Volumn 171, Issue 1-3, 1997, Pages 153-167
The number of connected sparsely edged uniform hypergraphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0006132944     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00076-3     Document Type: Article
Times cited : (17)
References (16)
  • 2
    • 84990723730 scopus 로고
    • The asymptotic number of labeled connected graphs with a given number of vertices and edges
    • E.A. Bender, E.A. Canfield and B.D. McKay, The asymptotic number of labeled connected graphs with a given number of vertices and edges, Random Struct. Algorithms 1 (1990) 127-169
    • (1990) Random Struct. Algorithms , vol.1 , pp. 127-169
    • Bender, E.A.1    Canfield, E.A.2    McKay, B.D.3
  • 3
    • 0011632190 scopus 로고
    • The evolution of sparse graphs
    • B. Bollobás, Ed., Graph Theory and Combinatorics, Academic Press, New York
    • B. Bollobás, The evolution of sparse graphs, in: B. Bollobás, Ed., Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. In honour of Paul Erdös (Academic Press, New York, 1984) 35-57.
    • (1984) Proc. Cambridge Combinatorial Conf. In Honour of Paul Erdös , pp. 35-57
    • Bollobás, B.1
  • 4
    • 84968486917 scopus 로고
    • The evolution of random graphs
    • B. Bollobás, The evolution of random graphs, Trans. Amer. Math. Soc. 286 (1984) 257-274.
    • (1984) Trans. Amer. Math. Soc. , vol.286 , pp. 257-274
    • Bollobás, B.1
  • 7
    • 0001309708 scopus 로고
    • Probability of indecomposabiliry of a random mapping
    • L. Katz, Probability of indecomposabiliry of a random mapping, Ann. Math. Statist. 26 (1955) 512-517.
    • (1955) Ann. Math. Statist. , vol.26 , pp. 512-517
    • Katz, L.1
  • 8
    • 84990642302 scopus 로고
    • On the number of sparse connected graphs
    • T. Łuczak, On the number of sparse connected graphs, Random Struct. Algorithms 1 (1990) 171-173.
    • (1990) Random Struct. Algorithms , vol.1 , pp. 171-173
    • ŁUczak, T.1
  • 9
    • 84990672934 scopus 로고
    • Cycles in a random graph near the critical point
    • T. Łuczak, Cycles in a random graph near the critical point, Random Struct. Algorithms 2 (1991) 421-439
    • (1991) Random Struct. Algorithms , vol.2 , pp. 421-439
    • ŁUczak, T.1
  • 10
    • 0001404742 scopus 로고
    • The structure of the random graph at the double-jump threshold
    • T. Łuczak, B. Pittel and J.C. Wierman, The structure of the random graph at the double-jump threshold, Trans. Amer. Math. Soc. 341 (1994) 721-748.
    • (1994) Trans. Amer. Math. Soc. , vol.341 , pp. 721-748
    • ŁUczak, T.1    Pittel, B.2    Wierman, J.C.3
  • 11
    • 4244055741 scopus 로고
    • The chromatic number of random graphs at the double-jump threshold
    • T. Łuczak and J.C. Wierman, The chromatic number of random graphs at the double-jump threshold, Combinatorica 9 (1989) 39-49.
    • (1989) Combinatorica , vol.9 , pp. 39-49
    • ŁUczak, T.1    Wierman, J.C.2
  • 13
    • 29444455124 scopus 로고
    • Perechislenie odnorodnykh hipergrafov c prostoǐ ciklovoǐ strukturoǐ
    • B.I. Selivanov, Perechislenie odnorodnykh hipergrafov c prostoǐ ciklovoǐ strukturoǐ, Kombinatornyǐ Analiz 2 (1972) 60-67.
    • (1972) Kombinatornyǐ Analiz , vol.2 , pp. 60-67
    • Selivanov, B.I.1
  • 14
    • 0001886010 scopus 로고
    • The number of connected sparsely edges graphs
    • E.M. Wright, The number of connected sparsely edges graphs, J. Graph Theory 1 (1977) 317-334.
    • (1977) J. Graph Theory , vol.1 , pp. 317-334
    • Wright, E.M.1
  • 15
    • 0039579533 scopus 로고
    • The number of connected sparsely edges graphs. II. Smooth graphs and blocks
    • E.M. Wright, The number of connected sparsely edges graphs. II. Smooth graphs and blocks, J. Graph Theory 2 (1978) 299-305.
    • (1978) J. Graph Theory , vol.2 , pp. 299-305
    • Wright, E.M.1
  • 16
    • 0007033389 scopus 로고
    • The number of connected sparsely edges graphs. III. Asymptotic results
    • E.M. Wright, The number of connected sparsely edges graphs. III. Asymptotic results, J. Graph Theory 4 (1980) 393-408
    • (1980) J. Graph Theory , vol.4 , pp. 393-408
    • Wright, E.M.1

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