In combinatorics, the Dinitz Theorem (formerly known as Dinitz Conjecture) is a statement about the extension of arrays to partial Latin squares… (More)

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)

Is this relevant?

2010

2010

- Klas Markström, Lars-Daniel Öhman
- Contributions to Discrete Mathematics
- 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)

Is this relevant?

2010

2010

- Tamás Fleiner, András Frank
- Electronic Notes in Discrete Mathematics
- 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

- Garth Isaak
- Electr. J. Comb.
- 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

- Timothy Y. Chow
- Discrete Mathematics
- 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

- Doron Zeilberger
- 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

- Jeannette C. M. Janssen, Jeff Dinitz
- 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