Sandwiching dense random regular graphs between binomial random graphs

DOI10.1007/S00440-022-01157-6MaRDI QIDQ2089753zbMATH OpenOpenAlexFDO

Authors Pu Gao, M. I. Isaev, Brendan D. McKay

Publication date 24 October 2022

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00440-022-01157-6

zbMATH Keywords

random graphcouplingsandwich conjecturesubgraph probability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)

Recommendations

• Sandwiching biregular random graphs
• Regular pairs in sparse random graphs I
• Packing vertices and edges in random regular graphs
• Subgraphs of dense random graphs with specified degrees
• Extreme degrees in random subgraphs of regular graphs

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• scientific article; zbMATH DE number 3773632 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• A characterization of the smallest eigenvalue of a graph
• A critical point for random graphs with a given degree sequence
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic enumeration by degree sequence of graphs of high degree
• Complex martingales and asymptotic enumeration
• Critical percolation on random regular graphs
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Maximum likelihood estimation in the \(\beta\)-model
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Random graphs with a given degree sequence
• Random regular graphs of high degree
• Sandwiching random graphs: universality between random graph models
• Sandwiching random regular graphs between binomial random graphs
• Subgraphs of dense random graphs with specified degrees
• The number of graphs and a random graph with a given degree sequence
• The phase transition in random graphs: a simple proof

Cited in

(4)

• Sandwiching biregular random graphs
• Degree sequences of sufficiently dense random uniform hypergraphs
• Correction to: ``Sandwiching dense random regular graphs between binomial random graphs
• On the restricted size Ramsey number for a pair of cycles

This page was built for publication: Sandwiching dense random regular graphs between binomial random graphs

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