A randomized construction of high girth regular graphs

Nati Linial, Michael Simkin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We describe a new random greedy algorithm for generating regular graphs of high girth: Let k ≥ 3 and c ∈ (0, 1) be fixed. Let (Formula presented.) ℕ be even and set (Formula presented.). Begin with a Hamilton cycle G on n vertices. As long as the smallest degree (Formula presented.), choose, uniformly at random, two vertices u, v ∈ V(G) of degree (Formula presented.) 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 (Formula presented.) labeled k-regular n-vertex graphs with girth at least g.

Original languageAmerican English
Pages (from-to)345-369
Number of pages25
JournalRandom Structures and Algorithms
Volume58
Issue number2
DOIs
StatePublished - Mar 2021

Bibliographical note

Publisher Copyright:
© 2020 Wiley Periodicals LLC

Keywords

  • graph processes
  • high-girth graphs
  • random greedy algorithms

Fingerprint

Dive into the research topics of 'A randomized construction of high girth regular graphs'. Together they form a unique fingerprint.

Cite this