Events items teaser

Combinatorial Optimization Reading Group - David Aleman
2023-03-24 12:00 (America/Toronto)
TITLE: Subgraph Polytopes and Independence Polytopes of Count Matroids

Speaker:
David Aleman

Affiliation:
University of Waterloo

Location:
MC 6029

ABSTRACT: Given a graph G=(V,E), the subgraph polytope of G is defined
as the convex hull of the characteristic vector of the pairs (S,F)
such that S is a non-empty subset of vertices and F is a set of edges
contained in the induced subgraph G[S].
