Results
Title

On Equitable Colorings of Hypergraphs.

Authors

Akhmejanova, M.

Abstract

A two-coloring is said to be equitable if, on the one hand, there are no monochromatic edges (the coloring is regular) and, on the other hand, the cardinalities of color classes differ from one another by at most 1. It is proved that, for the existence of an equitable two-coloring, it suffices that the number of edges satisfy an estimate of the same order as that for a regular coloring. This result strengthens the previously known Radhakrishnan-Srinivasan theorem.

Subjects

HYPERGRAPHS; COLORS; COLORING matter; EDGES (Geometry); RAMSEY theory

Publication

Mathematical Notes, 2019, Vol 106, Issue 3/4, p319

ISSN

0001-4346

Publication type

Academic Journal

DOI

10.1134/S0001434619090013