The Alon-Tarsi number of planar graphs
Combinatorics
2017-11-30 v1
Abstract
This paper proves that the Alon-Tarsi number of any planar graph is at most , which gives an alternate proof of the -choosability as well as the -paintability of planar graphs.
Cite
@article{arxiv.1711.10817,
title = {The Alon-Tarsi number of planar graphs},
author = {Xuding Zhu},
journal= {arXiv preprint arXiv:1711.10817},
year = {2017}
}
Comments
0 figures, 7 pages