Extremal Graphs for a Spectral Inequality on Edge-Disjoint Spanning Trees

04/04/2021
by   Sebastian M. Cioabă, et al.
MIT
0

Liu, Hong, Gu, and Lai proved if the second largest eigenvalue of the adjacency matrix of graph G with minimum degree δ≥ 2m+2 ≥ 4 satisfies λ_2(G) < δ - 2m+1/δ+1, then G contains at least m+1 edge-disjoint spanning trees, which verified a generalization of a conjecture by Cioabă and Wong. We show this bound is essentially the best possible by constructing d-regular graphs 𝒢_m,d for all d ≥ 2m+2 ≥ 4 with at most m edge-disjoint spanning trees and λ_2(𝒢_m,d) < d-2m+1/d+3. As a corollary, we show that a spectral inequality on graph rigidity by Cioabă, Dewar, and Gu is essentially tight.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/27/2018

(g,f)-Chromatic spanning trees and forests

A heterochromatic (or rainbow) graph is an edge-colored graph whose edge...
07/18/2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

We consider the following question: How many edge-disjoint plane spannin...
01/24/2021

Independent Spanning Trees in Eisenstein-Jacobi Networks

Spanning trees are widely used in networks for broadcasting, fault-toler...
02/28/2020

Edge-Disjoint Branchings in Temporal Graphs

A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...
12/09/2020

Decomposition of (2k+1)-regular graphs containing special spanning 2k-regular Cayley graphs into paths of length 2k+1

A P_ℓ-decomposition of a graph G is a set of paths with ℓ edges in G tha...
06/04/2021

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Graph sparsification has been studied extensively over the past two deca...
12/19/2017

The cavity approach for Steiner trees Packing problems

The Belief Propagation approximation, or cavity method, has been recentl...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1. Introduction

Let be a finite, simple graph on vertices, and let and be the eigenvalues of its adjacency and Laplacian matrices, respectively. Recall for -regular graphs [brouwer2011spectra, Ch. 1]. Additionally, let denote the maximum number of edge-disjoint spanning trees in , sometimes referred to as the spanning tree packing number (see Palmer [spanningpackingpalmer] for a survey of this parameter). Motivated by Kirchhoff’s celebrated matrix tree theorem on the number of spanning trees of a graph [kirchhoff1847ueber] and a question of Seymour [seymour], Cioabă and Wong [cioabaSpanningTrees] considered the relationship between the eigenvalues of a regular graph and .

They obtained a result by combining two useful theorems. The Nash-Williams/Tutte theorem [nash1961edge, tutte1961problem] (described in Section 2.2) implies that if is a -edge-connected graph, then . Additionally, Cioabă [cioabua2010eigenvalues] showed if is a -regular graph and is an integer with such that , then is -edge-connected. These facts imply that if is a -regular graph with for some integer , with , then contains edge-disjoint spanning trees. Cioabă and Wong conjectured the following factor of two improvement, which they verified for .

Conjecture 1 ([cioabaSpanningTrees]).

Let be an integer and be a -regular graph with . If , then .

This conjecture attracted much attention, leading to many partial results and generalizations [guthesis, spanningpacking, gu2016edge, hong2016fractional, li2013edge, liu2014edge]. The question was ultimately resolved by Liu, Hong, Gu, and Lai.

Theorem 2 ([noteOnTrees2014]).

Let be an integer and be a graph with minimum degree . If , then .

We show this bound is essentially the best possible.

Theorem 3.

For all , the -regular graph (defined in Section 2.1) has at most edge-disjoint spanning trees and satisfies

Cioabă and Wong created special cases of this construction for the families and (a slight variant of) in [cioabaSpanningTrees] to show that Theorem 2 is essentially best possible for . In his PhD thesis [wongthesis], Wong also constructed the family to show that Theorem 2 is essentially tight for . Based on the family of graphs for the small cases of that appeared in [cioabaSpanningTrees], Gu [spanningpacking] constructed a family of multigraphs by replacing every edge with multiple edges to show that the bounds in a multigraph analog of Theorem 2 are also the best possible. Additionally, Cioabă, Dewar, and Gu [cioabua2020spectral] used the variant of from [cioabaSpanningTrees] to show that a sufficient spectral condition for graph rigidity is essentially the best possible. We generalize their result in Section 5.

In Section 2, we will construct the family of graphs and prove the lower bound of Theorem 3. In Section 3, we will explicitly describe the characteristic polynomial of (Theorem 11), and in Section 4, we will use the characteristic polynomial to prove the upper eigenvalue bound of Theorem 3. The proof of the second eigenvalue bound uses a classical number theoretic technique, Graeffe’s method (see Lemma 12), which to the best of our knowledge has not previously been used for second eigenvalue bounds. This approach should generalize to upper bounds on the roots of interesting combinatorial polynomials.

2. Graph Construction

2.1. Construction

We construct a family of graphs such that , but for all . The graph contains copies of , each with a deleted matching of size . Then edges are added in a circulant manner to connect the vertices among the cliques with the deleted matchings.

Let . The vertex set of

consists of all ordered pairs

where and . Let , and let the subgraph induced by be , where

Now we connect edges among the . Let

where is taken modulo . Then

This construction makes a connected -regular graph. See Figures 2.1 and 2.2.

2.2. Spanning Trees

Our result, like many prior results on edge-disjoint spanning trees, crucially relies on a theorem from Nash-Williams and Tutte, which converts a condition on to one on vertex partitions. If the vertex set is partitioned into disjoint sets , then let be the number of edges with endpoints in both and .

Theorem 4 (Nash-Williams/Tutte [nash1961edge, tutte1961problem]).

Let be a connected graph and be an integer. Then if and only if for any partition .

As in the previous subsection, let be the modified cliques of . Since , we have

By Theorem 4, has at most edge-disjoint spanning trees. Then Theorem 2 implies , yielding the lower bound of Theorem 3. It remains to show .

Figure 2.1. with deleted dashed edges and labeled vertices.
Figure 2.2. with deleted dashed edges.

3. Characteristic Polynomial

The adjacency matrix of is a block circulant matrix. Following [blockCirculantEvalues], define to be the block circulant matrix

where each is a square matrix of equal dimension.

Lemma 5 ([blockCirculantEvalues]).

The characteristic polynomial of a real, symmetric, block circulant matrix is given by

where

and runs over the th roots of unity (including ).

To determine the characteristic polynomial of , we will also need the following lemmas from linear algebra. Let and

denote the identity matrix and all ones matrix of dimension

, respectively.

Lemma 6.

Let

be an invertible matrix and

be column vectors. Then,

Lemma 7.

We have

Finally, the characteristic polynomial of will require defining the Chebyshev polynomials of the first kind and Chebyshev polynomials of the second kind . We have [Abramowitz, p. 775, Equations (22.3.6) and (22.3.7)]

(3.1)
(3.2)

They are also given by the implicit equations and . We prove a few lemmas on the Chebyshev polynomials and their connection to roots of unity.

Lemma 8.

For ,

Proof.

Abramowitz and Stegun [Abramowitz, Page 787, Equation 22.16.4] provide the zeroes of as . The leading coefficient of is , as can be seen from equation (3.1), giving the product representation

Lemma 9.

For and any -th primitive root of unity ,

with the change of variables .

Proof.

Applying Lemma 8,

Also, we have

(3.3)

Taking a logarithm in Lemma 8 and then differentiating gives

(3.4)

where we used for . This can be verified from the series expansions of both. Substituting equation (3.4) into equation (3.3) with gives

We generalize Lemma 9 for all roots of unity .

Lemma 10.

For and , let be a -th root of unity, where . Define and . Then

with the change of variables .

Proof.

Note that is a primitive th root of unity. By Lemma 9,

Notice . Using the periodicity of roots of unity several times,

Similarly,

Finally, we compute the characteristic polynomial of . Denote to be the all ones matrix.

Theorem 11.

For , the characteristic polynomial of is

with the change of variables , , and .

Proof.

By the symmetric construction of , its adjacency matrix is a block circulant matrix . For any , there is only one edge between and . Then for , is a matrix with a single entry of in position . Moreover, for . Finally, is the adjacency matrix of any . That is,

By Lemma 5, the eigenvalues of the adjacency matrix are the union of the eigenvalues of each

where is a -th root of unity and

The characteristic polynomial is

We need the block determinant

Label the blocks . Passing to the Schur complement,

(3.5)

By Lemma 7,

(3.6)

Note . Then,

Let be the block matrix summand of and be the all ones vector of dimension . Notice that , so that we can apply Lemma 6 to give

(3.7)

Here, gives the sum of the entries of . The inverse of a block diagonal matrix is the block diagonal matrix of the inverses of the blocks. Then the th block of is

and

The determinant of a block diagonal matrix is the product of the blocks’ determinants, so

By Lemma 10,

Substituting into (3.7), we obtain

With (3.6), we simplify (3.5) to

Taking the product of over all roots of unity yields the characteristic polynomial. ∎

4. Bounding the second eigenvalue

Let denote the coefficient of in , and let be the roots of . Given any monic polynomial , we can rewrite as

Lemma 12 (Graeffe’s Method [Graeffe2]).

The largest root of a monic polynomial can be bounded by

(4.1)
Proof.

We compute

We know that this is an even function, so . Similarly, we can then compute

We conclude that

Moreover, only the powers of with degree at least multiply to produce a term of degree . By explicitly multiplying these polynomials out, we then have

The intuition behind why Graeffe’s method suffices here is that if the polynomial’s roots are well separated, then Graeffe’s method provides extremely precise approximations. Here, numerically we observed while the other roots were contained in . Then, passing to fourth powers using Graeffe’s method, the sum of fourth powers of all the roots is dominated by , so that taking a fourth root then provides a tight upper bound on the largest eigenvalue. We can use the same technique to derive a series of increasingly strong bounds on the largest root, as we incorporate more of the leading coefficients. For an introduction to the general method, see [Graeffe2]. For historical discussion of the origin of the name and method, see [Graeffe].

We require the following technical inequality.

Lemma 13.

For , we have

Proof.

Let and , so this statement reduces to showing

for . By clearing denominators, expanding, and dividing through by , this is equivalent to showing

Note that for , so we drop this term completely and divide by . It is left to show that