Skip to content

Zero Forcing: Minimum Rank Problems, Sample Error, Combinatorial Optimization, and More 09/13/2018

Speaker: Franklin Kenter, USNA
Date and time: Thursday, September 13, 4–5 pm
Location: Phillips 110

Abstract: In this talk, I will give an overview of zero forcing in graphs. What zero forcing is is not important. Rather, zero forcing appears, as the title suggests, to be at the intersection of many facets in combinatorics, and even mathematics more broadly. The goal of this talk will be to inspire you to consider zero forcing in your next pursuit of research.

Some results are joint work with Randy Davila and Jephian C-H. Lin.