Spectral Theory and Descriptive Combinatorics for Non-Regular Borel pmp Graphs

Abstract

We continue the systematic study initiated in arXiv:2602.05185 of the relationship between the spectral theory and descriptive combinatorics of bounded-degree Borel pmp graphs, particularly in the non-regular setting. We first adapt a classical result of Nikiforov to give a new spectral lower bound on the approximate measurable chromatic number. For certain non-regular graphs, this bound improves on the approximate measurable version of Hoffman's classical bound established in arXiv:2602.05185. Next, we strengthen a characterization in arXiv:2602.05185 of approximate measurable bipartiteness in terms of the spectrum of the adjacency operator by generalizing to the case of non-regular graphs. Finally, we introduce the measurable domination number and adapt several classical results of Lu, Liu, and Tian to give a bound on the spectral gap of the Laplacian operator in terms of the measurable domination number.