Sandbox:DavidKohler/Relativized Alon Conjecture/Regular tree completion

From UBC Wiki

The regular tree completion of a given graph allows us to see important properties of the starting graph. In particular, it shows us that some subgraphs, that we call tangles, have a high second eigenvalue.

Definition

Let G be a finite connected graph with maximal degree less or equal to some integer d larger than 2. We define the d-regular tree completion of G to be the unique (up to isomorphism) infinite graph, Treed(G) which consists of attaching additional free edges to all vertices so that the graph obtained is d-regular. Equivalently, this is the universal covering of the starting graph.

Properties

Let ψ be a connected graph with maximal degree at most d > 2. Then we have

Where λ1(Treed(ψ)) is the spectral radius of that infinite graph and where λIrred(ψ) is the largest irreducible eigenvalue of the graph ψ.

To do
To do icon In the proof of the property, there is a lemma that is missing a proof.