90 citations · 119 across the 9 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021
Higher-order generalizations of stability and arithmetic regularity
C. Terry, J. Wolf
We define a natural notion of higher order stability and show that subsets of that are tame in this sense can be approximately described by a union of low-complexi…
math.CO2021★ 2 cited
Irregular triads in 3-uniform hypergraphs
C. Terry, J. Wolf
Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition i…
math.CO2008
A note on Elkin's improvement of Behrend's construction
Ben Green, Julia Wolf
We provide a short proof of a recent result of Elkin in which large subsets of the integers 1 up to N free of 3-term progressions are constructed.