Year: 2018
Type: preprint
Abstract: Let $t\geqslant 2$ and $s\geqslant 1$ be two integers. Define a $(t,s)$-coloring of a hypergraph to be a coloring of its vertices using $t$ colors such that each color appears on each edge at least $s$ times. In this note, we provide a sufficient condition for the existence of a $(t,s)$-coloring of a hypergraph by using the symmetric lopsided version of Lovász Local Lemma. Our result generalizes several known results on hypergraph colorings.
Source: arXiv (Cornell University)
Author: Bai, Yandong
Institution: Northwestern Polytechnical University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G2556855538, G4907951372
OpenAlex ID: W2885376159