Perfect colorings of hypergraphs
From MaRDI portal
Abstract: Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for hypergraphs. Firstly, we introduce a multidimensional matrix equation for perfect colorings of hypergraphs and compare this definition with a standard approach based on the incidence graph. Next, we show that the eigenvalues of the parameter matrix of a perfect coloring are also eigenvalues of the multidimensional adjacency matrix of a hypergraph. We also consider coverings of hypergraphs as a special case of perfect colorings and prove a theorem on the existence of a common covering of two hypergraphs. At last, we provide the parameters of perfect -colorings of -uniform hypergraphs, calculate the parameters of transversals in hypergraphs (as perfect colorings), and find all perfect -colorings and some eigenvalues of the Fano's plane hypergraph.
This page was built for publication: Perfect colorings of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407135)
