19-25 June 2011
Bled, Slovenia
Europe/Ljubljana timezone
Home > Timetable > Contribution details
PDF | XML

Tutte polytope

Presented by Dr. Matjaz KONVALINKA
Type: Oral presentation
Track: Polytopes and Incidence Geometries

Content

We construct an n-dimensional polytope (with 2^n vertices and n(n+1)/2+1 facets) whose volume is equal to the Tutte polynomial of the complete graph, divided by n!. The proof is bijective and consists of a triangulation of the polytope into simplices naturally corresponding to labelled forests. We present several applications, among them an improved bound for the number of labelled connected graphs and new recursive formulas for the generating function of labelled connected graphs by the number of edges.

Place

Location: Bled, Slovenia
Address: Best Western Hotel Kompas Bled

Primary authors

More

Co-authors

More