Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,563,628 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Edge coloring
Graph theory
List edge-coloring
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2001
2001
Random Colorings of Graphs and the Dinitz Conjecture
Ramin Naimi
2001
Corpus ID: 116213673
Consider the following game: Little cups are placed on certain squares of acheckerboard, and you are to throw into each cup a die…
Expand