paper

On Alon-Tarsi orientations of sparse graphs

arXiv:2509.00657

Abstract

Assume is a graph, is a sequence of distinct vertices of , and is an integer sequence with . We say is \emph{-list extendable} (respectively, \emph{-AT extendable}) with respect to if is -choosable (respectively, -AT), where for , and for . Hutchinson proved that if is an outerplanar graph, then is -list extendable with respect to for any vertices . We strengthen this result and prove that if is a -minor-free graph, then is -AT extendable with respect to for any vertices . Then we characterize all triples of a -minor-free graph for which is -AT extendable (as well as -list extendable) with respect to . We also characterize the pairs of a -minor-free graph for which is -AT extendable (as well as -list extendable) with respect to . Moreover, we characterize all triples of a 3-colorable graph with its maximum average degree less than for which is -AT extendable with respect to .