This meeting is on the probabilistic method problem session in the spirit of Valentine’s day. We went over some interesting bounds on dominating sets and Hamiltonian cycles in tournaments that can be easily derived from the probabilistic method. Check out the slides here : https://drive.google.com/open?id=1hS_qSnxrXiyniuuNB-TNTTGG3ar1lO2Ztyr0veeKRuk

Previous: Distance Preservers

This meeting will be a talk on sparse distance preservers of graphs given by Greg Bodwin.

continue reading ❯