Alon-Tarsi for hypergraphs
Combinatorics
2025-01-03 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2501.00157,
title = {Alon-Tarsi for hypergraphs},
author = {Marcin Anholcer and Bartłomiej Bosek and Grzegorz Gutowski and Michał Lasoń and Jakub Przybyło and Oriol Serra and Michał Tuczyński and Lluís Vena and Mariusz Zając},
journal= {arXiv preprint arXiv:2501.00157},
year = {2025}
}