Sandwiching biregular random graphs

DOI10.1017/S0963548322000049MaRDI QIDQ5885183zbMATH OpenOpenAlexFDO

Authors Tereza Klimošová, Christian Reiher, Andrzej Ruciński, M. Şileikis

Publication date 3 April 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

embeddingcouplingrandom regular graphmonotone graph propertybipartite random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Sandwiching dense random regular graphs between binomial random graphs
• Regular pairs in sparse random graphs I
• Embedding large graphs into a random graph
• Universality of random graphs
• Subgraphs of random graphs with specified degrees

Cites work

• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration of dense 0-1 matrices with specified line sums
• Dense expanders and pseudo-random bipartite graphs
• Distribution inequalities for the binomial law
• Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
• Matchings in random biregular bipartite graphs
• Random regular graphs of high degree
• Sandwiching random graphs: universality between random graph models
• Sandwiching random regular graphs between binomial random graphs

Cited in

(1)

• Sandwiching dense random regular graphs between binomial random graphs

This page was built for publication: Sandwiching biregular random graphs

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