Given a hypergraph , define for every edge a linear expression with arguments corresponding with the vertices. Next, let the polynomial be the product of such linear expressions for all edges. Our main goal was to find a relationship between the Alon-Tarsi number of and the edge density of . We prove that if all the coefficients in are equal to . Our main result is that, no matter what those coefficients are, they can be permuted within the edges so that for the resulting polynomial , holds. We conjecture that, in fact, permuting the coefficients is not necessary. If this were true, then in particular a significant generalization of the famous 1-2-3 Conjecture would follow.

生成讲解博客的中文版本

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