An Arithmetic Analogue of Fox's Triangle Removal Argument

zbMath1331.05113arXiv1304.4921MaRDI QIDQ2789638

Sushant Sachdeva, Madhur Tulsani, Pooya Hatami

Publication date: 2 March 2016

Full work available at URL: https://arxiv.org/abs/1304.4921

zbMATH Keywords

Szemerédi's regularity lemmaremoval lemmagraph property testing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Other combinatorial number theory (11B75)

Related Items

A tight bound for Green's arithmetic triangle removal lemma in vector spaces ⋮ Kneser graphs are like Swiss cheese ⋮ Lower bounds for testing triangle-freeness in Boolean functions