Search arXivSearch

arXiv · 2208.04801

The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus

Abstract

Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and $(1/4)\ln n$, respectively. We derive an asymptotic expression for $C_{n,g}$ when $(n-2g)/\ln n$ lies in any closed subinterval of $(0,2)$. Using rotation systems and Bender's theorem about generating functions with fast-growing coefficients, we derive simple asymptotic expressions for the numbers of rooted regular maps, disregarding the genus. In particular, we show that the number of rooted cubic maps with $2n$ vertices, disregarding the genus, is asymptotic to $\frac{3}π\,n!6^n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhicheng Gao. 2023-07-09. The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus. https://arxiv.org/abs/2208.04801

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO