Sandwiching dense random regular graphs between binomial random graphs

DOI10.1007/S00440-022-01157-6zbMATH Open1505.05115OpenAlexW4290075478MaRDI QIDQ2089753FDOQ2089753

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)

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

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

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)

Cites Work

• Title not available (Why is that?)
• A critical point for random graphs with a given degree sequence
• 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
• A characterization of the smallest eigenvalue of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Random regular graphs of high degree
• Subgraphs of dense random graphs with specified degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sandwiching random graphs: universality between random graph models
• Random Regular Graphs of Non-Constant Degree: Connectivity and Hamiltonicity
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• The phase transition in random graphs: a simple proof
• The number of graphs and a random graph with a given degree sequence
• Critical percolation on random regular graphs
• Complex martingales and asymptotic enumeration
• Sandwiching random regular graphs between binomial random graphs

Cited In (4)

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

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)