On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918422950969344 |
|---|---|
| author | Manurangsi, Pasin |
| author_facet | Manurangsi, Pasin |
| contents | We show that a simple scoring-based tie-breaking can help improve lower bounds for the expansion (aka isoperimetric number) of random regular graphs with small even degrees. Specifically, for degrees 4, 6 and 8, we show that, with high probability, the expansions are at least 0.489, 1.120 and 1.813 respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_00488 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees Manurangsi, Pasin Combinatorics We show that a simple scoring-based tie-breaking can help improve lower bounds for the expansion (aka isoperimetric number) of random regular graphs with small even degrees. Specifically, for degrees 4, 6 and 8, we show that, with high probability, the expansions are at least 0.489, 1.120 and 1.813 respectively. |
| title | On Expansion of Random Regular Graphs: Improved Lower Bounds for Small Even Degrees |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.00488 |