On Equitable Colorings of Hypergraphs


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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.

About the authors

M. Akhmejanova

Advanced Combinatorics and Network Applications Laboratory

Author for correspondence.
Email: mechmathrita@gmail.com
Russian Federation, Dolgoprudnyi, Moscow Oblast, 141701

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Pleiades Publishing, Ltd.