Sandwiching random regular graphs between binomial random graphs

DOI10.1137/1.9781611975994.42MaRDI QIDQ5146810zbMATH OpenOpenAlexFDO

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

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(8)

• Sandwiching dense random regular graphs between binomial random graphs
• The average distance and the diameter of dense random regular graphs
• Sandwiching biregular random graphs
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity
• The number of perfect matchings, and the nesting properties, of random regular graphs
• Triangles and subgraph probabilities in random regular graphs
• Detecting structured signals in Ising models
• Embedding theorems for random graphs with specified degrees

This page was built for publication: Sandwiching 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 Q5146810)