Video Lectures

Separate tags with a comma.
For a family of graphs F, a graph G is F-universal if G contains every graph in F as a (not necessarily induced) subgraph. A natural candidate to serve as universal graph G is the random graph G(n,p). In this case, we want to find an optimal p for...

The Zilber-Pink conjecture is a far reaching finiteness conjecture in diophantine geometry, unifying and extending Mordell-Lang and Andre-Oort. This lecture will state the conjecture, illustrate its varied faces, and indicate how the point-counting...

A graph G is called a small set expander if any small set of vertices contains only a small fraction of the edges adjacent to it. This talk is mainly concerned with the investigation of small set expansion on the Grassmann Graphs, a study that was...