9 citations · 29 across the 37 of their papers we have counts for
4 papers · 1 filter
The inertia bound is far from tight
Matthew Kwan, Yuval Wigderson
The inertia bound and ratio bound (also known as the Cvetković bound and Hoffman bound) are two fundamental inequalities in spectral graph theory, giving upper bounds on the indepe…
On the Kohayakawa-Kreuter conjecture
Eden Kuperwasser, Wojciech Samotij, Yuval Wigderson
Let us say that a graph is Ramsey for a tuple of graphs if every -coloring of the edges of contains a monochromatic copy of in color , for som…
On linear-algebraic notions of expansion
Yinan Li, Youming Qiao, Avi Wigderson +2
A fundamental fact about bounded-degree graph expanders is that three notions of expansion -- vertex expansion, edge expansion, and spectral expansion -- are all equivalent. In thi…
An efficient asymmetric removal lemma and its limitations
Lior Gishboliner, Asaf Shapira, Yuval Wigderson
The triangle removal states that if contains edge-disjoint triangles, then contains triangles. Unfortunately, there are no sensible bo…