Speaker: Tai Ha (Tulane University)
Title: Combinatorial structures through algebraic lenses
We shall discuss an algebraic approach to investigate a number of important invariants and structures in graph theory and integer linear programming. Particularly, we shall focus on how to compute the chromatic numbers, how to recognize the existence of odd cycles in graphs, and how to detect integer linear programming systems with packing and max-flow-min-cut properties.
Location: Colloquium Room 319, Chase Building