Graphs with Independent Exact $r$-covers for all $r$

TL;DR

This paper constructs finite regular graphs with independent exact r-covers for all r, answering a question in graph theory and providing minimal constructions for certain degrees.

Contribution

It introduces new constructions of regular graphs with independent exact r-covers for all r, including minimal order graphs for degrees 3 to 6, and revisits covering theorems to optimize graph size.

Findings

Constructed finite d-regular graphs with independent exact r-covers for all r ≤ d.

Derived divisibility conditions on graph order for such covers.

Provided minimal order constructions for degrees 3, 4, 5, 6.

Abstract

For every natural number $d$, we construct finite $d$-regular simple graphs that, for every $r \le d$, contain an independent exact $r$-cover. This answers a question of Gray and Johnson that arose in their study of 2-step transit probabilities. We obtain some divisibility conditions on the order $n$ of graphs that for every $r \le d$ contain an independent exact $r$-cover, and give constructions for $d=3, 4, 5, 6$ where the order of the graph is minimal (we deduce this minimality from our divisibility conditions). We construct these graphs as common coverings of smaller graphs. We revisit a result of Angluin and Gardiner on finite common coverings of two regular graphs of the same degree, and the result of Gross that regular graphs of even degree are Schreier coset graphs. We combine both results to provide a finite common covering of two regular graphs of the same degree, that uses fewer vertices than the construction of Angluin and Gardiner in some cases.