A randomized construction of high girth regular graphs

TL;DR

This paper introduces a new random greedy algorithm for constructing high girth regular graphs, demonstrating that it produces such graphs with high probability and establishing a lower bound on their count.

Contribution

The paper presents a novel randomized method for generating high girth regular graphs and provides probabilistic guarantees of its success.

Findings

Produces high girth regular graphs with high probability

Establishes a lower bound on the number of such graphs

Introduces a new random greedy algorithm for graph construction

Abstract

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices. As long as the smallest degree $\delta (G)<k$, choose, uniformly at random, two vertices $u,v \in V(G)$ of degree $\delta(G)$ whose distance is at least $g-1$. If there are no such vertex pairs, abort. Otherwise, add the edge $uv$ to $E(G)$. We show that with high probability this algorithm yields a $k$-regular graph with girth at least $g$. Our analysis also implies that there are $\left( \Omega (n) \right)^{kn/2}$ labeled $k$-regular $n$-vertex graphs with girth at least $g$.