Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs

Carlos Hoppen, Nicholas Wormald

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)

Abstract

We introduce a general class of algorithms and analyse their application to regular graphs of large girth. In particular, we can transfer several results proved for random regular graphs into (deterministic) results about all regular graphs with sufficiently large girth. This reverses the usual direction, which is from the deterministic setting to the random one. In particular, this approach enables, for the first time, the achievement of results equivalent to those obtained on random regular graphs by a powerful class of algorithms which contain prioritised actions. As a result, we obtain new upper or lower bounds on the size of maximum independent sets, minimum dominating sets, maximum k-independent sets, minimum k-dominating sets and maximum k-separated matchings in r-regular graphs with large girth.

Original languageEnglish
Pages (from-to)619-664
Number of pages46
JournalCombinatorica
Volume38
Issue number3
DOIs
Publication statusPublished - Jun 2018

Cite this