User Tools

Site Tools


Ting Su (Binghamton)

Neighborliness in Edge Polytopes

Abstract for the Combinatorics Seminar 2014 October 14

The (unoriented) edge polytope of a graph G is the convex polytope whose vertices are the columns of the unoriented incidence matrix of G. They form a rich family of 0/1-polytopes with interesting properties. In particular, there is a simple graph-theoretic characterization of neighborliness of edge polytopes. I will present work of Tuan and Ziegler that explores these properties.

seminars/comb/abstract.201410su.txt · Last modified: 2020/01/29 14:03 (external edit)