Prefer a chat interface with context about you and your work?
Fractional Decompositions and the Smallest-eigenvalue Separation
A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very short proof of a generalization and strengthening of a recent result …