Penn Arts & Sciences Logo

Thursday, January 22, 2004 - 3:15pm

Benny Sudakov

Princeton

Location

Penn

DRLB (math building) 4E9

Properties of random $d$-regular graphs were studied extensively starting with late 70's. But until very recently almost all the results were obtained for graphs whose degree $d$ is relatively small compared to the number of vertices $n$. In this talk we survey various results for dense random regular graphs which were obtained in the last few yeas. We will focus on the new approaches which were used and discuss some interesting questions which are still open.