Asymptotics of local face distributions and the face distribution of the complete graph
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914831457583104 |
|---|---|
| author | Loth, Jesse Campion |
| author_facet | Loth, Jesse Campion |
| contents | We are interested in the distribution of the number of faces across all the $2-$cell embeddings of a graph, which is equivalent to the distribution of genus by Euler's formula. In order to study this distribution, we consider the local distribution of faces at a single vertex. We show an asymptotic uniformity on this local face distribution which holds for any graph with large vertex degrees.
We use this to study the usual face distribution of the complete graph. We show that in this case, the local face distribution determines the face distribution for almost all of the whole graph. We use this result to show that a portion of the complete graph of size $(1-o(1))|K_n|$ has the same face distribution as the set of all permutations, up to parity. Along the way, we prove new character bounds and an asymptotic uniformity on conjugacy class products. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_02774 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Asymptotics of local face distributions and the face distribution of the complete graph Loth, Jesse Campion Combinatorics 05C10 (Primary) 05E10 (Secondary) We are interested in the distribution of the number of faces across all the $2-$cell embeddings of a graph, which is equivalent to the distribution of genus by Euler's formula. In order to study this distribution, we consider the local distribution of faces at a single vertex. We show an asymptotic uniformity on this local face distribution which holds for any graph with large vertex degrees. We use this to study the usual face distribution of the complete graph. We show that in this case, the local face distribution determines the face distribution for almost all of the whole graph. We use this result to show that a portion of the complete graph of size $(1-o(1))|K_n|$ has the same face distribution as the set of all permutations, up to parity. Along the way, we prove new character bounds and an asymptotic uniformity on conjugacy class products. |
| title | Asymptotics of local face distributions and the face distribution of the complete graph |
| topic | Combinatorics 05C10 (Primary) 05E10 (Secondary) |
| url | https://arxiv.org/abs/2211.02774 |