Abstract
Perfect colourings (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 colourings for hypergraphs. Firstly, we introduce a multidimensional matrix equation for perfect colourings 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 colouring are eigenvalues of the multidimensional adjacency matrix of a hypergraph. We consider coverings of hypergraphs as a special case of perfect colourings and prove a theorem on the existence of a common covering of two hypergraphs. As an example, we show that a k-transversal in a hypergraph corresponds to a perfect colouring and calculate its parameters. At last, we find all perfect 2-colourings of the Fano's plane hypergraph and compute some eigenvalues of this hypergraph.
Published Version
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 call