Subgraph counts for dense random graphs with specified degrees

DOI10.1017/S0963548320000498zbMath1466.05197arXiv1801.09813OpenAlexW2787245964MaRDI QIDQ4993134

Brendan D. McKay, Mikhail Isaev, Catherine Greenhill

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

spanning treesuniformly random graph

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Vertex degrees (05C07) Density (toughness, etc.) (05C42)

Related Items

Distribution of tree parameters by martingale approach, The minimum number of spanning trees in regular multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced subgraph in random regular graph
• Small subgraphs of random regular graphs
• Conditional essential suprema with applications
• Asymptotic enumeration by degree sequence of graphs of high degree
• The average number of spanning trees in sparse graphs with given degrees
• Random regular graphs of high degree
• Subgraphs of Dense Random Graphs with Specified Degrees
• Complex martingales and asymptotic enumeration