AI & Computingarticle2026-09-25

Alon–Tarsi for Hypergraphs

Open access0 citations

Abstract

Given a hypergraph $H=(V, E)$, define for every edge $e\in E$ a linear expression with arguments corresponding to the vertices. Next, let the polynomial $p_H$ be the product of such linear expressions for all edges. Our main goal is to find a relationship between the Alon-Tarsi number of $p_H$ and the edge density of $H$. We prove that $AT(p_H)=\lceil \mathrm{ed}(H)\rceil+1$ if all the coefficients in $p_H$ are equal to $1$ and the base field has characteristic zero. Our main result is that, over an arbitrary field, if on every edge the coefficients are not all equal, then they can be permuted within the edges so that for the resulting polynomial $p_H^\prime$, $AT(p_H^\prime)\leq 2\lceil \mathrm{ed}(H)\rceil+1$ holds. We conjecture that this bound holds for every hypergraph polynomial without permuting its coefficients. If this were true, then in particular a significant generalization of the famous 1-2-3 Conjecture would follow.

// Source

View paper (DOI)Open access versionOpenAlexThe Electronic Journal of CombinatoricsPublished 2026-09-25

Authors: Marcin Anholcer, Bartłomiej Bosek, Grzegorz Gutowski, Michał Lasoń, Jakub Przybyło, Oriol Serra, Michał Tuczyński, Lluís Vena, Mariusz Zając

Institutions: Jagiellonian University, Polish Academy of Sciences, AGH University of Krakow, Universitat Politècnica de Catalunya, Warsaw University of Technology, Czech Academy of Sciences, Institute of Mathematics, Poznań University of Economics and Business