Metraipolis › archive › dc_b94df736de9d

Mex (mathematics) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Mex_(mathematics)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:19:51.051Z
SHA-256 of the archived text
439b157bde319b428c66f3fd7326479d91021efc5e78cc21c2f6bdbebf740371
Stable URL of this page
https://metraipolis.com/documento/dc_b94df736de9d

How to cite

Mex (mathematics) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Mex_(mathematics) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b94df736de9d (Metraipolis archive dc_b94df736de9d, sha256 439b157bde319b428c66f3fd7326479d91021efc5e78cc21c2f6bdbebf740371)
BibTeX
@misc{dcb94df736de9d,
  title = {Mex (mathematics) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Mex_(mathematics)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b94df736de9d; sha256 439b157bde319b428c66f3fd7326479d91021efc5e78cc21c2f6bdbebf740371},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Mex_(mathematics). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, the mex (minimum excluded value) of a subset of a well-ordered set is the smallest value from the whole set that does not belong to the subset. That is, it is the minimum value of the complement set. Beyond sets, subclasses of well-ordered classes have minimum excluded values. Minimum excluded values of subclasses of the ordinal numbers are used in combinatorial game theory to assign nim-values to impartial games. According to the Sprague–Grundy theorem, the nim-value of a game position is the minimum excluded value of the class of values of the positions that can be reached in a single move from the given position. Minimum excluded values are also used in graph theory, in greedy coloring algorithms. These algorithms typically choose an ordering of the vertices of a graph and choose a numbering of the available vertex colors. They then consider the vertices in order, for each vertex choosing its color to be the minimum excluded value of the set of colors already assigned to its neighbors.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «game theory»).
Fonte: Wikipedia in inglese, voce «Mex (mathematics)» — https://en.wikipedia.org/wiki/Mex_(mathematics)
Wikidata Q6825699 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q6825699
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Mex_(mathematics)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376572404, consultata il 2026-10-07T22:00:34.444Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 9a817ad02b26c726dc039fe23a07290431cafcaf265e048d9921bb6b17548fb1