English

On Alon-Tarsi orientations of sparse graphs

Combinatorics 2025-09-03 v1

Abstract

Assume GG is a graph, (v1,,vk)(v_1,\ldots,v_k) is a sequence of distinct vertices of GG, and (a1,,ak)(a_1,\ldots,a_k) is an integer sequence with ai{1,2}a_i \in \{1,2\}. We say GG is \emph{(a1,,ak)(a_1,\ldots,a_k)-list extendable} (respectively, \emph{(a1,,ak)(a_1,\ldots,a_k)-AT extendable}) with respect to (v1,,vk)(v_1,\ldots,v_k) if GG is ff-choosable (respectively, ff-AT), where f(vi)=aif(v_i)=a_i for i{1,,k}i \in \{1,\ldots, k\}, and f(v)=3f(v)=3 for vV(G){v1,,vk}v \in V(G) \setminus \{v_1,\ldots, v_k\}. Hutchinson proved that if GG is an outerplanar graph, then GG is (2,2)(2,2)-list extendable with respect to (x,y)(x,y) for any vertices x,yx,y. We strengthen this result and prove that if GG is a K4K_4-minor-free graph, then GG is (2,2)(2,2)-AT extendable with respect to (x,y)(x,y) for any vertices x,yx,y. Then we characterize all triples (x,y,z)(x,y,z) of a K4K_4-minor-free graph GG for which GG is (2,2,2)(2,2,2)-AT extendable (as well as (2,2,2)(2,2,2)-list extendable) with respect to (x,y,z)(x,y,z). We also characterize the pairs (x,y)(x,y) of a K4K_4-minor-free graph GG for which GG is (2,1)(2,1)-AT extendable (as well as (2,1)(2,1)-list extendable) with respect to (x,y)(x,y). Moreover, we characterize all triples (x,y,z)(x,y,z) of a 3-colorable graph GG with its maximum average degree less than 145\frac{14}{5} for which GG is (2,2,2)(2,2,2)-AT extendable with respect to (x,y,z)(x,y,z).

Keywords

Cite

@article{arxiv.2509.00657,
  title  = {On Alon-Tarsi orientations of sparse graphs},
  author = {Eun-Kyung Cho and Ilkyoo Choi and Boram Park and Xuding Zhu},
  journal= {arXiv preprint arXiv:2509.00657},
  year   = {2025}
}
R2 v1 2026-07-01T05:13:46.818Z