Sandwiching dense random regular graphs between binomial random graphs

DOI10.1007/s00440-022-01157-6zbMath1505.05115OpenAlexW4290075478MaRDI QIDQ2089753

Mikhail Isaev, Pu Gao, Brendan D. McKay

Publication date: 24 October 2022

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16) Density (toughness, etc.) (05C42)

Related Items

Degree sequences of sufficiently dense random uniform hypergraphs, On the restricted size Ramsey number for a pair of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Maximum likelihood estimation in the \(\beta\)-model
• 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
• Sandwiching random graphs: universality between random graph models
• Random regular graphs of high degree
• The phase transition in random graphs: A simple proof
• Subgraphs of Dense Random Graphs with Specified Degrees
• Critical percolation on random regular graphs
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• A characterization of the smallest eigenvalue of a graph
• Complex martingales and asymptotic enumeration
• A critical point for random graphs with a given degree sequence
• The number of graphs and a random graph with a given degree sequence
• Sandwiching random regular graphs between binomial random graphs