Sandwiching biregular random graphs
From MaRDI portal
Publication:5885183
DOI10.1017/S0963548322000049OpenAlexW3095902000MaRDI QIDQ5885183
Matas Šileikis, Tereza Klimošová, Christian Reiher, Andrzej Ruciński
Publication date: 3 April 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.15751
Cites Work
- Unnamed Item
- Embedding the Erdős-Rényi hypergraph into the random regular hypergraph and Hamiltonicity
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
- Distribution inequalities for the binomial law
- Asymptotic enumeration by degree sequence of graphs of high degree
- Sandwiching random graphs: universality between random graph models
- Matchings in random biregular bipartite graphs
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Dense expanders and pseudo-random bipartite graphs
- Random regular graphs of high degree
- Sandwiching random regular graphs between binomial random graphs
- Asymptotic Enumeration of Hypergraphs by Degree Sequence
This page was built for publication: Sandwiching biregular random graphs
