On the Houdr\'e-Tetali conjecture about an isoperimetric constant of graphs
Abstract
Houdr\'e and Tetali defined a class of isoperimetric constants of graphs for , and conjectured a Cheeger-type inequality for of the form where is the second smallest eigenvalue of the normalized Laplacian matrix. If true, the conjecture would be a strengthening of the hard direction of the classical Cheeger's inequality. Morris and Peres proved Houdr\'e and Tetali's conjecture up to an additional log factor, using techniques from evolving sets. We present the following related results on this conjecture. - We provide a family of counterexamples to the conjecture of Houdr\'e and Tetali, showing that the logarithmic factor is needed. - We match Morris and Peres's bound using standard spectral arguments. - We prove that Houdr\'e and Tetali's conjecture is true for any constant strictly bigger than , which is also a strengthening of the hard direction of Cheeger's inequality. Furthermore, our results can be extended to directed graphs using Chung's definition of eigenvalues for directed graphs.
Keywords
Cite
@article{arxiv.2407.11357,
title = {On the Houdr\'e-Tetali conjecture about an isoperimetric constant of graphs},
author = {Lap Chi Lau and Dante Tjowasi},
journal= {arXiv preprint arXiv:2407.11357},
year = {2024}
}