加载中…
We study the relation between the correspondence chromatic number and the Alon–Tarsi number, both upper bounds on the list chromatic number of a graph. There are many graphs with Alon–Tarsi number greater than the correspondence chromatic number. We present here a family of graphs with arbitrary Alon–Tarsi number, with correspondence chromatic number one larger. Keywords: correspondence coloring, Alon–Tarsi number AMS Mathematics Subject Classification: 05C15

生成讲解博客的中文版本

生成AI智能校验的中文版本