Induced subgraphs in sparse random graphs with given degree sequences

DOI10.1016/j.ejc.2012.01.009zbMath1242.05248arXiv1011.3810OpenAlexW2059134409MaRDI QIDQ427801

Pu Gao, Yi Su, Nicholas C. Wormald

Publication date: 18 June 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.3810

zbMATH Keywords

asymptotic formularandom graphgiven degree sequenceuniformly random regular graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items (1)

A transition of limiting distributions of large matchings in random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of matchings in random regular graphs and bipartite graphs
• When are small subgraphs of a random graph normally distributed?
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• The asymptotic number of non-negative integer matrices with given row and column sums
• Subgraphs of Dense Random Graphs with Specified Degrees
• Regular induced subgraphs of a random Graph
• Random dense bipartite graphs and directed graphs with specified degrees
• Distribution of subgraphs of random regular graphs

This page was built for publication: Induced subgraphs in sparse random graphs with given degree sequences