A maximal independent set in a graph is a largest possible set of vertices that are mutually non-adjacent, meaning no two vertices in the set share an edge. It is maximal in the sense that adding any other vertex to the set would violate its independence, but not necessarily maximum, as there can be other independent sets with equal or greater size.