A tight bound for Green's arithmetic triangle removal lemma in vector spaces

DOI10.1137/1.9781611974782.106zbMath1433.11022OpenAlexW2462199236MaRDI QIDQ4575849

László Miklós Lovász, Jacob Fox

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.106

zbMATH Keywords

Green's arithmetic triangle removal lemma

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

A Sauer-Shelah-Perles lemma for sumsets ⋮ Four‐term progression free sets with three‐term progressions in all large subsets

This page was built for publication: A tight bound for Green's arithmetic triangle removal lemma in vector spaces