![Random regular graph / Matroid theory / Graph / Connectivity / Regular graph / Pseudoforest / Line graph / Graph theory / Mathematics / Random graphs Random regular graph / Matroid theory / Graph / Connectivity / Regular graph / Pseudoforest / Line graph / Graph theory / Mathematics / Random graphs](https://www.pdfsearch.io/img/5d3a6262ba1abfc41013e1008cdfcd18.jpg) Date: 2012-10-02 14:35:23Random regular graph Matroid theory Graph Connectivity Regular graph Pseudoforest Line graph Graph theory Mathematics Random graphs | | The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d ≥ 3, almost all d-regular graphs on {1, 2, . . . , n} have edge-expansion ratio at least cd d (if nd is even), whereAdd to Reading ListSource URL: snap.stanford.eduDownload Document from Source Website File Size: 177,19 KBShare Document on Facebook
|