Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
We discuss problems in list coloring with an emphasis on techniques that utilize oriented graphs. Our central theme is Galvin’s… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
2010
2010
Galvin solved the Dinitz conjecture by proving that bipartite graphs are edge-choosable. We improve Galvin’s method and deduce… Expand
2001
2001
Consider the following game: Little cups are placed on certain squares of acheckerboard, and you are to throw into each cup a die… Expand
1997
1997
We show that the choice number of a graph G is equal to its chromatic number when G belongs to a restricted class of claw-free… Expand
  • figure I
  • figure 2
1995
1995
  • T. Chow
  • Discret. Math.
  • 1995
  • Corpus ID: 6895468
We present previously unpublished elementary proofs by Dekker and Ottens (1991) and Boyce (private communication) of a special… Expand
1995
1995
Fred Galvin's amazing proof of the Dinitiz conjecture is used to illustrate the method of undetermined generalization and… Expand
1993
1993
The Dinitz conjecture states that, for each $n$ and for every collection of $n$-element sets $S_{ij}$, an $n\times n$ partial… Expand
1989
1989
Publisher Summary An r × n latin rectangle is an r × n array filled with m symbols, say, such that every cell contains one symbol… Expand