The Alon-Tarsi number of a planar graph minus a matching

Wednesday, February 27, 2019 - 1:00pm to 2:00pm
Location: 
WXLR A113

Speaker

Ming Han
Arizona State University

Abstract

We present the proof of a newest result: every planar graph G contains a matching M such that the Alon-Tarsi number of $G −M$ is at most 4. As a consequence, $G −M$ is 4-paintable, and hence $G$ itself is $1$-defective $4$-paintable. This improves a result of Cushing and Kierstead, who proved that every planar graph is $1$-defective $4$-choosable.

share:


Event Type