Strong approximation in random graphs

Yair Glasner (Be'er Sheva), mercredi 4 mars 2009, 15h15, salle MA12

Abstract:

I will discuss some analogues of the strong approximation theory (usually associated with arithmetic groups) in combinatorics.