Explicit Two-Sided Unique-Neighbor Expanders

Explicit Two-Sided Unique-Neighbor Expanders

We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor expanders, meaning bipartite graphs where small sets contained in both the left and right bipartitions exhibit unique-ne...

Full description

Bibliographic Details
Main Authors: Hsieh, Jun-Ting, McKenzie, Theo, Mohanty, Sidhanth, Paredes, Pedro
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: ACM 2024
Online Access:https://hdl.handle.net/1721.1/155660

Internet

https://hdl.handle.net/1721.1/155660

Similar Items