SCOPUS 정보 검색 플랫폼

Volumn 142, Issue 1, 2002, Pages 125-135

The phase transition in a random hypergraph

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PHASE TRANSITIONS; RANDOM PROCESSES; THEOREM PROVING;

HYPERGRAPHS;

COMPUTATIONAL METHODS;

MATHEMATICAL ANALYSIS;

EID: 0036565753 PISSN: 03770427 EISSN: None Source Type: Journal
DOI: 10.1016/S0377-0427(01)00464-2 Document Type: Article

Times cited : (76)

References (10)

1
- 84990723730
- The asymptotic number of labeled connected graphs with a given number of vertices and edges
- (1990) Random Struct. Algorithms , vol.1 , pp. 127-169
- Bender, E.A.¹ Canfield, E.A.² McKay, B.D.³

2
- 84968486917
- The evolution of random graphs
- (1984) Trans. Amer. Math. Soc , vol.286 , pp. 257-274
- Bollobás, B.¹

4
- 0001847481
- On the evolution of random graphs
- (1960) Publ. Math. Sci. Hung. Acad. Sci , vol.5 , pp. 17-61
- Erdös, P.¹ Rényi, A.²

5
- 84990671427
- The birth of the giant component
- (1993) Random Struct. Algorithms , vol.4 , pp. 233-358
- Janson, S.¹ Knuth, D.E.² Łuczak, T.³ Pittel, B.⁴

7
- 0006132944
- The number of connected sparsely edged uniform hypergraphs
- (1997) Discrete Math , vol.171 , pp. 153-167
- Karoński, M.¹ Łuczak, T.²

8
- 84990709764
- Component behavior near the critical point of the random graph process
- (1990) Random Struct. Algorithms , vol.1 , pp. 287-310
- Łuczak, T.¹

9
- 51249176947
- Component structure in the evolution of random hypergraphs
- (1985) Combinatorica , vol.5 , pp. 81-94
- Schmidt-Pruzan, J.¹ Shamir, E.²

10
- 29444455124
- Perechislenie odnorodnykh hipergrafov c prostoǐ ciklovoǐ strukturoǐ
- (1972) Kombinatornyǐ Analiz , vol.2 , pp. 60-67
- Selivanov, B.I.¹

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