On equitable colorings of hypergraphs

DOI10.1134/S0001434619090013zbMath1433.05108OpenAlexW2981349428WikidataQ127025353 ScholiaQ127025353MaRDI QIDQ2291188

Margarita Akhmejanova

Publication date: 30 January 2020

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434619090013

zbMATH Keywords

hypergraphequitable coloringhypergraph coloringequitable two-coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Equitable two-colorings of uniform hypergraphs
• A fast algorithm for equitable coloring
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: On equitable colorings of hypergraphs