Speaker: |
Sagnik Mukhopadhyay |

Organiser: |
Rakesh Venkat |

Date: |
Friday, 22 Feb 2013, 14:30 to 16:00 |

Venue: |
A-212 (STCS Seminar Room) |

(Scan to add to calendar)

$$perm(A) \leq \prod_{i\in [n]}(r_i !)^{1/r_i}$$

This upper bounds the number of perfect matchings in a bi-partite graph. We are going to prove it.