## Events Search and Views Navigation

## 12:15 pm

### Subgraph statistics (Benny Sudakov, ETH Zurich)

Given integers $k,l$ and a graph $G$, how large can be the fraction of $k$-vertex subsets of $G$ which span exactly $l$ edges? The systematic study of this very natural question was recently initiated by Alon, Hefetz, Krivelevich and Tyomkyn who also proposed several interesting conjectures on this topic. In this talk we discuss a theorem […]

Find out more »