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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1989-2012
01219892012

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The sign of a Latin square is −1 if it has an odd number of rows and columns that are odd permutations; otherwise, it is +1. Let… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2010
2010
An n × n array is avoidable if for each set of n symbols there is a Latin square on these symbols which differs from the array in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are ∆edge-choosable. We improve Galvin’s method and deduce… (More)
Is this relevant?
Review
2002
Review
2002
A graph is f -choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors… (More)
Is this relevant?
1995
1995
We present previously unpublished elementary proofs by Dekker and Ottens (1991) and Boyce (private communication) of a special… (More)
Is this relevant?
1995
1995
I will illustrate this proof strategy in terms of Fred Galvin’s[G] recent brilliant proof of the Dinitz conjecture. Following a… (More)
Is this relevant?
1993
1993
The Dinitz conjecture states that, for each « and for every collection of «-element sets S,; , an « x n partial latin square can… (More)
Is this relevant?
1989
1989
 
Is this relevant?