Editing Hypergraph (section)

==Hypergraph coloring==
Classic hypergraph coloring is assigning one of the colors from set <math>\{1,2,3,...,\lambda\}</math> to every vertex of a hypergraph in such a way that each hyperedge contains at least two vertices of distinct colors. In other words, there must be no monochromatic hyperedge with cardinality at least 2. In this sense it is a direct generalization of graph coloring. The minimum number of used distinct colors over all colorings is called the chromatic number of a hypergraph.

Hypergraphs for which there exists a coloring using up to ''k'' colors are referred to as ''k-colorable''. The 2-colorable hypergraphs are exactly the bipartite ones.

There are many generalizations of classic hypergraph coloring. One of them is the so-called mixed hypergraph coloring, when monochromatic edges are allowed. Some mixed hypergraphs are uncolorable for any number of colors. A general criterion for uncolorability is unknown.  When a mixed hypergraph is colorable, then the minimum and maximum number of used colors are called the lower and upper chromatic numbers respectively.<ref>{{Cite web |title=Vitaly Voloshin: Mixed Hypergraph Coloring Website |url=http://spectrum.troy.edu/voloshin/mh.html |access-date=2022-04-27 |website=spectrum.troy.edu |archive-date=2022-01-20 |archive-url=https://web.archive.org/web/20220120170127/http://spectrum.troy.edu/voloshin/mh.html |url-status=live }}</ref>