[Theory-reading] AP3-free reading group for coming week

[Seeun William Umboh <seeun@xxxxxxxxxxx>]

Hi all,

Dalibor and I will be presenting the following papers this coming week:

Noga Alon
Testing subgraphs in large graphs, Proc. 42 IEEE FOCS, IEEE (2001),
434-441. Also: Random Structures and Algorithms 21 (2002), 359-370.
http://www.math.tau.ac.il/~nogaa/PDFS/testsubproc.pdf

Noga Alon and Asaf Shapira
Linear Equations, Arithmetic Progressions and Hypergraph Property Testing
Theory of Computing Journal, Volume 1, Article 9 (pages 177-216)
http://theoryofcomputing.org/articles/v001a009/

Note that we will not be presenting them one paper at a time. Instead,
Dalibor will present the graph and hypergraph constructions on
Tuesday, and I will present the use of arithmetic progression-free
sets on Thursday.

William