Seminar

Title: Rectangle covers and bounding the extension complexity of the correlation polytope

Title: Taking limits in Go-diagrams

Title: Steiner Cut Dominants

Abstract: For a subset of terminals T of the nodes of a graph G a cut in G is called a T-Steiner cut if it subdivides T into two non-empty sets. The Steiner cut dominant of G is the Minkowski sum of the convex hull of the incidence vectors of T-Steiner cuts in G and the nonnegative orthant.

Title: Edge domination in incidence graphs

Title: An f-coloring generalization of linear arboricity

Title: Distance-regular graphs with primitive automorphism groups

Title: Bargain hunting in a Coxeter group

Title:Periodicity of bipartite walks on certain graphs and its connections to periodicity of Grover's walk

Title: Conic lifts of convex sets

Title: Matroids without cliques

Abstract: The class of graphs that omit some fixed complete graph as a minor is very well-studied; in particular, the densest graphs in the class are known. The analogous question for matroids is just as well-motivated, but seems harder to answer. I will discuss some recent progress in this area, which reduces a bound from doubly exponential to singly exponential. This is joint work with Sergey Norin and Fernanda Rivera Omana.