Expanders graphs and sieving in combinatorial structures

Florent Jouve, Jean-Sébastien Sereni

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one pe…