On the sum of the largest and smallest eigenvalues of odd-cycle free graphs

TL;DR

This paper extends previous bounds on the sum of the largest and smallest eigenvalues in odd-cycle free graphs, showing it diminishes inversely with odd girth and providing specific bounds for girth 7.

Contribution

It generalizes Csikvári's 2022 result to all odd girth values, establishing a bound that decreases with girth and offering a tighter bound for girth 7.

Findings

The sum of eigenvalues divided by n is O(k^{-1}) for odd girth k.

For odd girth 7, the bound is less than 0.0396.

Extends spectral bipartiteness measures to general odd girth cases.

Abstract

Let $G$ be a graph with adjacency eigenvalues $\lambda_1 \geq \cdots \geq \lambda_n$. Both $\lambda_1 + \lambda_n$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$. Csikv\'ari proved in 2022 that for odd girth 5 graphs (triangle-free) it holds that $(\lambda_1+\lambda_n)/n \le (3-2\sqrt 2) < 0.1716$. In this paper we extend Csikv\'ari's result to general odd girth $k$ proving that $(\lambda_1+\lambda_n)/n = O(k^{-1})$. In the case of odd girth 7, we prove a stronger upper bound of $(\lambda_1+\lambda_n)/n < 0.0396$.