Autor:	Gordeev, Alexey, Petrov, Fedor
Rok vydání:	2020
Předmět:	Mathematics - Combinatorics
Zdroj:	Moscow J. Comb. Number Th. 10 (2021) 271-279
Druh dokumentu:	Working Paper
DOI:	10.2140/moscow.2021.10.271
Popis:	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)$ is a graph with degrees of vertices $2d(v), v\in V$, and the graph polynomial $\prod_{(i,j)\in E} (x_j-x_i)$ contains an "almost central" monomial (that means a monomial $\prod_v x_v^{c_v}$, where $\|c_v-d(v)\|\leqslant 1$ for all $v\in V$), then the Cartesian product $G\square C_{2n}$ is $(d(\cdot)+2)$-choosable. Comment: the proof of the main theorem is simplified in ver. 2
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2007.07140 Zobrazit plný text záznamu View this record from Arxiv