Speaker: Craig Larson, VCU
Date and time: Tuesday, February 6, 1–2 pm
Place: Rome 771
Abstract: We discuss the use of modern computer tools and resources to systematically advance our shared mathematical goals. In this talk we will discuss the available tools in the context of a summer 2017 project to find bounds for the independence number of a graph.
The independence number is the cardinality of a maximum independent set in a graph. Two conjectured theorems will be discussed, together with a selection of three interesting conjectures.