2000 character limit reached
The dual Cheeger-Buser inequality for graphons
Published 21 Feb 2025 in math.CO | (2502.15213v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.