Correction to: ``Sandwiching dense random regular graphs between binomial random graphs
DOI10.1007/S00440-023-01221-9zbMATH Open1520.05087OpenAlexW4385455207MaRDI QIDQ6095845FDOQ6095845
Authors: Pu Gao, M. I. Isaev, Brendan D. McKay 
Publication date: 8 September 2023
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-023-01221-9
Recommendations
- Corrigendum: On fractional K-factors of random graphs
- Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)]
- Sandwiching dense random regular graphs between binomial random graphs
- Corrigendum to: ``The asymptotic number of connected \(d\)-uniform hypergraphs
- Corrigendum: ``Forcing a sparse minor
Random graphs (graph-theoretic aspects) (05C80) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)
Cited In (5)
- Corrigendum to: ``A bound for the distinguishing index of regular graphs
- Corrigendum: ``Forcing a sparse minor
- Erratum to: ``First passage percolation on random graphs with finite mean degrees
- Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401-439
- Corrigendum: On fractional K-factors of random graphs
This page was built for publication: Correction to: ``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 Q6095845)
