Generalized Hypergraph Coloring

TL;DR

This paper generalizes hypergraph coloring by characterizing critical hypergraphs under hereditary properties and list assignments, extending classical results like Brooks' theorem to a broader hypergraph context.

Contribution

It introduces a characterization of $( ext{P},L)$-critical hypergraphs and proves a Gallai-type theorem for these structures, generalizing existing coloring bounds.

Findings

Gallai-type theorem for $( ext{P},L)$-critical hypergraphs

Brooks-type bound for $( ext{P},L)$-colorable hypergraphs

Gallai bound for degree sum in locally linear hypergraphs

Abstract

A smooth hypergraph property $\mathcal{P}$ is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hypergraph but not all hypergraphs. In this paper we examine $\mathcal{P}$-colorings of hypergraphs with smooth hypergraph properties $\mathcal{P}$. A $\mathcal{P}$-coloring of a hypergraph $H$ with color set $C$ is a function $\varphi:V(H) \to C$ such that $H[\varphi^{-1}(c)]$ belongs to $\mathcal{P}$ for all $c \in C$. Let $L: V(H) \to 2^C$ be a so called list-assignment of the hypergraph $H$. Then, a $(\mathcal{P},L)$-coloring of $H$ is a $\mathcal{P}$-coloring $\varphi$ of $H$ such that $\varphi(v) \in L(v)$ for all $v \in V(H)$. The aim of this paper is a characterization of $(\mathcal{P},L)$-critical hypergraphs. Those are hypergraphs $H$ such $H-v$ is $(\mathcal{P},L)$-colorable for all $v \in V(H)$ but $H$ itself is not. Our main theorem is a Gallai-type result for critical hypergraphs, which implies a Brooks-type result for $(\mathcal{P},L)$-colorable hypergraphs. In the last section, we prove a Gallai bound for the degree sum of $(\mathcal{P},L)$-critical locally linear hypergraphs.