{"title":"直接产品的Alon–Tarsi数","authors":"A. Gordeev, F. Petrov","doi":"10.2140/moscow.2021.10.271","DOIUrl":null,"url":null,"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)$ 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.","PeriodicalId":36590,"journal":{"name":"Moscow Journal of Combinatorics and Number Theory","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Alon–Tarsi numbers of direct products\",\"authors\":\"A. Gordeev, F. Petrov\",\"doi\":\"10.2140/moscow.2021.10.271\",\"DOIUrl\":null,\"url\":null,\"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)$ 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.\",\"PeriodicalId\":36590,\"journal\":{\"name\":\"Moscow Journal of Combinatorics and Number Theory\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Moscow Journal of Combinatorics and Number Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2140/moscow.2021.10.271\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow Journal of Combinatorics and Number Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/moscow.2021.10.271","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
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.