Pritam Majumder, TIFR

Description
Title: Spanning trees of the hypercube

Abstract: We will give a combinatorial proof of a product formula for the
number of spanning trees of the n-dimensional hypercube. The proof we will
present is a simplified version of the proof given by Bernardi.
Description
Ramanujan Hall
Date
Wed, October 26, 2016
Start Time
11:00am-12:00pm IST
Duration
1 hour
Priority
5-Medium
Access
Public
Created by
DEFAULT ADMINISTRATOR
Updated
Mon, October 24, 2016 9:00am IST