Partitioning of Loop-Free Sperner Hypergraphs Into Transversals

Abstract

This article explores possibilities of partitioning the vertex set of a given simple loop-free Sperner hypergraph into a union of transversals. Studies are done on the possible number of transversals in such partitions, followed by forming a hypergraph (on the vertex set of the given hypergraph) that consists of transversals for hyperedges.