Finding maximal independent sets is a classical problem in graph theory. In this thesis, we
extend the related concepts in graph theory to k-uniform hypergraphs, attempting to find the …