Abstract
The paper deals with a problem concerning equitable vertex colorings of uniform hypergraphs, i.e., colorings under which there are no monochromatic edges and simultaneously all the color classes have almost the same cardinalities. We obtain a new bound on the edge number of an n-uniform hypergraph that guarantees the existence of an equitable vertex coloring with r colors for this hypergraph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
