Alon -- Tarsi numbers of direct products

preprint2021arXivOpen access

Abstract

We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if G=(V,E)G=(V,E) is a graph with degrees of vertices 2d(v),v∈V2d(v), v\in V, and the graph polynomial ∏(i,j)∈E(xj−xi)\prod_{(i,j)\in E} (x_j-x_i) contains an "almost central" monomial (that means a monomial ∏vxvcv\prod_v x_v^{c_v}, where ∣cv−d(v)∣⩽1|c_v-d(v)|\leqslant 1 for all v∈Vv\in V), then the Cartesian product G□C2nG\square C_{2n} is (d(⋅)+2)(d(\cdot)+2)-choosable.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.