On the Houdr\'e-Tetali conjecture about an isoperimetric constant of graphs
Lap Chi Lau, Dante Tjowasi

TL;DR
This paper investigates the Houdré-Tetali conjecture on isoperimetric constants of graphs, providing counterexamples, confirming the conjecture for certain parameters, and extending results to directed graphs, thereby advancing understanding of graph spectral properties.
Contribution
The paper presents counterexamples to the conjecture, confirms it for p > 1/2, and extends findings to directed graphs, refining the theoretical landscape of graph isoperimetric inequalities.
Findings
Counterexamples show the logarithmic factor is necessary.
The conjecture holds for all p > 1/2.
Results extend to directed graphs using Chung's eigenvalues.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Limits and Structures in Graph Theory · advanced mathematical theories
