Pim van der Hoorn, Gabor Lippner, Elchanan Mossel
Published 2019-04-03Version 1
We compute the leading asymptotics of the probability that a random d-regular graph has linearly many triangles. We also show that such graphs typically consist of many disjoint $d + 1$-cliques and an almost triangle-free part.
Expansion of Random Graphs: New Proofs, New Results
More on the sixth coefficient of the matching polynomial in regular graphs
A Note on $\{k,n-k\}$-Factors of Regular Graphs
![QR code for arXiv:1904.02212 [math.CO]](http://oss.arxitics.com/images/favicon.svg)