Search arXivSearch

arXiv · 2410.07061

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

Abstract

A $(d_1,d_2)$-biregular bipartite graph $G=(L\cup R,E)$ is called left-$(m,δ)$ unique-neighbor expander iff each subset $S$ of the left vertices with $|S|\leq m$ has at least $δd_1|S|$ unique-neighbors, where unique-neighbors mean vertices with exactly one neighbor in $S$. 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 $(n^{1/3-ε},1-ε)$ lossless expanders for arbitrary $ε>0$ and aspect ratio. (2) Left-$(Ω(n),1-ε)$ lossless expanders with right-$(n^{1/3-ε},δ)$ expansion for some $δ>0$. (3) Two-sided-$(Ω(n),δ)$ unique-neighbor expanders with two-sided-$(n^{Ω(1)},1/2-ε)$ expansion. The second construction exhibits the first explicit family of one-sided lossless expanders with unique-neighbor expansion for polynomial-sized sets from the other side and constant aspect ratio. The third construction gives two-sided unique-neighbor expanders with additional $(1/2-ε)$ unique-neighbor expansion for two-sided polynomial-sized sets, which approaches the $1/2$ requirement in Lin and Hsieh (arXiv:2203.03581). Our techniques involve tripartite product recently introduced by Hsieh et al (STOC 2024), combined with a generalized existence argument of biregular graph with optimal two-sided unique-neighbor expansion for almost all degrees. We also use a new reduction from large girth/bicycle-freeness to vertex expansion, which might be of independent interest.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yeyuan Chen. 2024-10-09. Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets. https://arxiv.org/abs/2410.07061

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO