2025/02/21 by Pokharanakar, Mugdha Mahesh · 2 citations
#05C50 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2502.15213
We introduce the notion of bipartiteness ratio for graphons. We prove the dual Cheeger-Buser inequality for graphons, which relates the gap between 2 and the top of the spectrum of the Laplacian of a graphon with its bipartiteness ratio. The dual Cheeger-Buser inequality was established by Trevisan and Bauer-Jost for graphs. Our result is an analog of that for graphons.