Dinitz conjecture

Dinitz conjecture In combinatorics, the Dinitz theorem (formerly known as Dinitz conjecture) is a statement about the extension of arrays to partial Latin squares, proposed in 1979 by Jeff Dinitz,[1] and proved in 1994 by Fred Galvin.[2][3] The Dinitz theorem is that given an n × n square array, a set of m symbols with m ≥ n, and for each cell of the array an n-element set drawn from the pool of m symbols, it is possible to choose a way of labeling each cell with one of those elements in such a way that no row or column repeats a symbol. It can also be formulated as a result in graph theory, that the list chromatic index of the complete bipartite graph {style d'affichage K_{n,n}} équivaut à {displaystyle n} . C'est-à-dire, if each edge of the complete bipartite graph is assigned a set of {displaystyle n} colors, it is possible to choose one of the assigned colors for each edge such that no two edges incident to the same vertex have the same color.

Galvin's proof generalizes to the statement that, for every bipartite multigraph, the list chromatic index equals its chromatic index. The more general edge list coloring conjecture states that the same holds not only for bipartite graphs, but also for any loopless multigraph. An even more general conjecture states that the list chromatic number of claw-free graphs always equals their chromatic number.[4] The Dinitz theorem is also related to Rota's basis conjecture.[5] References ^ Erdős, P; Rubin, UN. L; Taylor, H. (1979). "Choosability in graphs". Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata (PDF). Congressus Numerantium. Volume. 26. pp. 125–157. Archivé de l'original (PDF) sur 2016-03-09. Récupéré 2017-04-22. ^ F. Galvin (1995). "The list chromatic index of a bipartite multigraph". Journal de théorie combinatoire. Série B. 63 (1): 153–158. est ce que je:10.1006/jctb.1995.1011. ^ Zeilberger, ré. (1996). "The method of undetermined generalization and specialization illustrated with Fred Galvin's amazing proof of the Dinitz conjecture". Mensuel mathématique américain. 103 (3): 233–239. arXiv:math/9506215. est ce que je:10.2307/2975373. ^ Gravier, Sylvain; Maffray, Frédéric (2004). "On the choice number of claw-free perfect graphs". Mathématiques discrètes. 276 (1–3): 211–218. est ce que je:10.1016/S0012-365X(03)00292-9. M 2046636. ^ Chow, J. Oui. (1995). "On the Dinitz conjecture and related conjectures" (PDF). Mathématiques discrètes. 145 (1–3): 73–82. est ce que je:10.1016/0012-365X(94)00055-N. Weissstein externe gauche, Eric W. "Dinitz Problem". MathWorld.

This combinatorics-related article is a stub. Vous pouvez aider Wikipédia en l'agrandissant.

Catégories: CombinatoricsLatin squaresGraph coloringTheorems in discrete mathematicsConjecturesConjectures that have been provedCombinatorics stubs