Vertices of given degree in a random graph

DOI10.1002/JGT.3190060209MaRDI QIDQ3964620zbMATH OpenOpenAlexFDO

Authors Béla Bollobás

Publication date 1982

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190060209

zbMATH Keywords

random labelled graphvertex degrees

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial probability (60C05)

Cited in

(18)

• On the degrees of vertices in a bichromatic random graph
• Rulers and slaves in a random social group
• On the chromatic forcing number of a random graph
• Large cycles in random generalized Johnson graphs
• Concentration of maximum degree in random planar graphs
• Random hypergraph irregularity
• Extreme degrees in random subgraphs of regular graphs
• The degree distribution of the random multigraphs
• Some remarks about extreme degrees in a random graph
• Poisson convergence and semi-induced properties of random graphs
• scientific article; zbMATH DE number 404551 (Why is no real title available?)
• Compressive sensing for cut improvement and local clustering
• The maximum and minimum degree of the random \(r\)-uniform \(r\)-partite hypergraphs
• The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes
• Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph
• Building graphs with high minimum degree on a budget
• Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs G(n, m) and G(n, p)
• Random subgraphs of the n-cycle

This page was built for publication: Vertices of given degree in a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964620)