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...
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 |
Similar Items
-
Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
by: Kamber, Amitay, et al.
Published: (2022) -
Tracing Linguistic Relations in Winning and Losing Sides of Explicit Opposing Groups
by: Sanli, Ceyda, et al.
Published: (2017) -
From Pilots to Stable Services: Documenting the Rise and Diversity of Microtransit in the U.S.
by: Humann, McKenzie
Published: (2024) -
Television New Zealand case study
by: McKenzie, Stuart.
Published: (2008) -
Utilizing Product Development Value Stream Mapping In U.S. Air Force Acquisition Program Offices
by: McKenzie, Scott
Published: (2014)