On random graphs I

  • P. Erdijs, A. RCnyi
  • Published 2001

Abstract

probabilities) one of the t 1 (I ; possible graphs which can be formed from N, the n (labelled) vertices PI, P?, . . ., P,, by selecting N edges from the i) ; possible edges Px (1 5 i < j 5 n), Thus the effective number of vertices of C,,,lmay be less than n, as some points Pi may be not connected in r,, X with any other point P,; we shall call such points… (More)

Topics

Statistics

0100200300'00'02'04'06'08'10'12'14'16'18
Citations per Year

3,701 Citations

Semantic Scholar estimates that this publication has 3,701 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Erdijs2001OnRG, title={On random graphs I}, author={P. Erdijs and A. RCnyi}, year={2001} }