Year: 2026
Type: preprint
Abstract: The DP color function $P_{DP}(\mathcal{H}, k)$ of a hypergraph $\mathcal{H}$ is defined as the minimum possible value of $P_{DP}(\mathcal{H}, \mathcal{F})$ taken over all $k$-fold covers $\mathcal{F}$ of $\mathcal{H}$. It serves as an extension of the classical chromatic polynomial. In this paper, we investigate the DP color function for two constructions: the join of a hypergraph with a complete graph and vertex-gluings of certain hypergraphs. Both constructions extend some results of Becker et al.
Source: arXiv (Cornell University)
Authors: Cui, Ruiyi, Wan, Liangxia, Dong, Fengming
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Award: G2931821092
OpenAlex ID: W7221527414