A graph is -partite when its vertices can be partitioned into classes, each an independent set. Edges may be missing between different classes. If all possible edges between different classes occur, it is a complete multipartite graph.
A **multipartite graph** is a specific type of graph used in graph theory, where the vertex set can be divided into multiple distinct subsets such that no two vertices within the same subset are adjacent. In other words, the edges of the graph only connect vertices from different subsets.
New to topics? Read the docs here!