On the number of vertices of given degree in a random graph
From MaRDI portal
Publication:3313902
DOI10.1002/jgt.3190080119zbMath0532.05052OpenAlexW2131924292MaRDI QIDQ3313902
Publication date: 1984
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190080119
Related Items
Bins and balls: Large deviations of the empirical occupancy process ⋮ Rulers and slaves in a random social group ⋮ Some remarks about extreme degrees in a random graph ⋮ Extreme degrees in random subgraphs of regular graphs ⋮ Poisson convergence and semi-induced properties of random graphs ⋮ Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph ⋮ On the probability of the occurrence of a copy of a fixed graph in a random distance graph ⋮ A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph ⋮ Concentration of measure for the number of isolated vertices in the Erdős-Rényi random graph by size bias couplings ⋮ On the degrees of vertices in a bichromatic random graph ⋮ Random subgraphs of the n-cycle