Metric uniformization and spectral bounds for graphs

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate “Riemannian” metric to uniformize the geometry of the graph. In many interesting cases, the existence of such a metric is shown by examining the combinatorics of special types of flows. This involves proving new inequalities on the crossing number of graphs. In particular, we use our method to show that for any positive integer k, the kth smallest eigenvalue of the Laplacian on an n-vertex, bounded-degree planar graph is O(k/n). This bound is asymptotically tight for every k, as it is easily seen to be achieved for square planar grids. We also extend this spectral result to graphs with bounded genus, and graphs which forbid fixed minors. Previously, such spectral upper bounds were only known for the case k=2.

💡 Research Summary

The paper introduces a novel framework for deriving upper bounds on the eigenvalues of the graph Laplacian by constructing a “Riemannian” metric on the graph that uniformizes its geometry. Traditional spectral bounds often rely on combinatorial distances, electrical resistance, or embeddings into Euclidean space, but these approaches become weak when the graph has high degree, non‑planar topology, or complex minor structure. The authors’ key insight is to define a metric via a carefully chosen flow on the edges. By assigning a scalar flow value to each edge and interpreting the flow as an electrical current, one obtains a length for each edge; the induced metric then measures distances as the minimal total flow‑length along paths.

A central technical contribution is a new family of crossing‑number inequalities. For a given flow, the crossing number counts how many times the flow lines intersect when the graph is drawn in a surface. The authors prove that one can always select a flow whose crossing number is bounded in terms of the maximum degree and the number of vertices. In planar graphs the crossing number can be made zero, which yields a metric that is essentially the Euclidean distance of a planar embedding. This metric provides tight control over volume and diameter, allowing the application of a Cheeger‑type inequality to bound the Rayleigh quotient of the k‑th eigenfunction. Consequently, they obtain the universal bound

\