Speaker: Rachel Galindo 

 

Title: On graphs with chromatic number and maximum degree both equal to 9

 

 

Abstract: An equivalent version of the Borodin-Kostochka Conjecture, due to Cranston and Rabern, says that any graph with \(\chi = \Delta = 9\) contains \(K_3 \lor E_6\) as a subgraph. In this talk we will discuss several results in support of this conjecture, where vertex-criticality and forbidden substructure conditions get us either close or all the way to containing \(K_3 \lor E_6\).

 

 

This is joint work with Jessica McDonald.