Skip to search formSkip to main contentSkip to account menu

Dinitz conjecture

Known as: Dinitz problem 
In combinatorics, the Dinitz Theorem (formerly known as Dinitz Conjecture) is a statement about the extension of arrays to partial Latin squares… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Edge coloringGraph theoryList edge-coloring

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Extensions of Galvin's Theorem
We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin’s… 
2010
2010
Balanced list edge-colourings of bipartite graphs
2001
2001
Random Colorings of Graphs and the Dinitz Conjecture
Consider the following game: Little cups are placed on certain squares of acheckerboard, and you are to throw into each cup a die… 
1997
1997
Choice number of 3-colorable elementary graphs
1995
1995
On the Dinitz conjecture and related conjectures
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)