activity
20122022
most citedUpper bounds for sunflower-free sets

46 citations · 132 across the 13 of their papers we have counts for

collaborators
Showing math.COShow all

6 papers · 1 filter

math.CO2022

The Chromatic Number of with Multiple Forbidden Distances

Eric Naslund

Let be a finite set of distances, and let be the graph with vertex set and edge set $\{(x,y)\in\mathbb{R}^{n}:\ \…

math.CO2022

Upper Bounds For Families Without Weak Delta-Systems

Eric Naslund

For , a collection of sets is said to form a \emph{weak -system} if the intersection of any two sets from the collection has the same size. Erdős and Szemerédi asked…

math.CO2019★ 12 cited

Monochromatic Equilateral Triangles in the Unit Distance Graph

Eric Naslund

Let denote the minimum number of colors needed to color so that there will not be a monochromatic equilateral triangle with side length .…

math.CO2017★ 7 cited

Exponential Bounds for the Erdős-Ginzburg-Ziv Constant

Eric Naslund

The Erdős-Ginzburg-Ziv constant of an abelian group , denoted , is the smallest such that any sequence of elements of of length contain…

math.CO2017★ 45 cited

The Partition Rank of a Tensor and -Right Corners in

Eric Naslund

Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce…

math.CO2016★ 46 cited

Upper bounds for sunflower-free sets

Eric Naslund, William F. Sawin

A collection of sets is said to form a -sunflower, or -system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal…