Welcome to the Mixed Hypergraph Coloring Website

Classical coloring theory focuses on finding the minimum number of colors. The basic idea of mixed hypergraphs is to introduce, in the most general setting, the problem of finding the maximum number of colors, and to combine it with the classical approach.

The main conclusion is that, when one attempts to establish a formal symmetry between these two opposite types of constraints, one discovers a deep asymmetry between minimization and maximization problems for the number of colors. This asymmetry pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring.