Cheeger constants and bipartiteness ratios of Cayley graphons
Mugdha Mahesh Pokharanakar
Abstract
We show, under a certain assumption, that the Cheeger constant of a connected Cayley graphon is bounded from above in terms of its bipartiteness ratio, and also in terms of the gap between the top of the spectrum of its Laplacian and 2. Using this result, we prove that if a connected Cayley graphon C(G,γ) is bipartite, then there exists an index two subgroup H of G that avoids the support of γ.
Create a lesson
Related papers
Generic solutions to symmetric linear equations
Bryce Frederickson, Liana Yepremyan
On Colorful Kruskal--Katona Theorems
Ting-Wei Chao, Maya Sankar, Hung-Hsun Hans Yu
An optimal constant for vector balancing with permutations
Jonathan Niles-Weed, Shay Sadovsky, Jacob Shkrob
Typical intersecting families at n=2k+1 and n=2k+2
Lina Li
Linear arboricity conjecture for infinite graphs
Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
Linear circumference in vertex-transitive graphs
Jie Ma, Ziyuan Zhao