Keywords
MathematicsDiscrete mathematics
Related Publications
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Po...
Are randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined b...
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
An algorithm for constructing the aspect graph
In this paper we present tight bounds on the maximum size of aspect graphs and give worstcase optimal algorithms for their construction, first in the convex case and then in the...
Publication Info
- Year
- 2022
- Type
- article
- Volume
- 6
- Issue
- 3-4
- Pages
- 290-297
- Citations
- 4980
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
4980
OpenAlex
Cite This
P. Erdős,
A. Rényi
(2022).
On random graphs. I..
Publicationes Mathematicae Debrecen
, 6
(3-4)
, 290-297.
https://doi.org/10.5486/pmd.1959.6.3-4.12
Identifiers
- DOI
- 10.5486/pmd.1959.6.3-4.12