Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
Yeyuan Chen

TL;DR
This paper presents new explicit constructions of unique-neighbor expanders with improved expansion properties for polynomial-sized sets, advancing the design of bipartite graphs with strong expansion characteristics.
Contribution
The paper introduces three novel explicit constructions of unique-neighbor expanders with better expansion for polynomial-sized sets, using tripartite products and new reduction techniques.
Findings
Constructed two-sided lossless expanders for arbitrary epsilon.
Developed one-sided lossless expanders with polynomial-sized sets.
Achieved two-sided unique-neighbor expanders approaching 1/2 expansion.
Abstract
A -biregular bipartite graph is called left- unique-neighbor expander iff each subset of the left vertices with has at least unique-neighbors, where unique-neighbors mean vertices with exactly one neighbor in . We can also define right/two-sided expanders similarly. In this paper, we give the following three strongly explicit constructions of unique-neighbor expanders with better unique-neighbor expansion for polynomial-sized sets, while sufficient expansion for linear-sized sets is also preserved: (1) Two-sided lossless expanders for arbitrary and aspect ratio. (2) Left- lossless expanders with right- expansion for some . (3) Two-sided- unique-neighbor expanders with…
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
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · graph theory and CDMA systems
