Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dinitz_conjecture> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Dinitz_conjecture abstract "In combinatorics, the Dinitz conjecture is a statement about the extension of arrays to partial Latin squares, proposed in 1979 by Jeff Dinitz, and proved in 1994 by Fred Galvin. The Dinitz conjecture, now a theorem, is that given an n × n square array, a set of m symbols with m ≥ n, and for each cell of the array an n-element set drawn from the pool of m symbols, it is possible to choose a way of labeling each cell with one of those elements in such a way that no row or column repeats a symbol.The Dinitz conjecture is closely related to graph theory, in which it can be succinctly stated as for natural . It means that the list chromatic index of the complete bipartite graph equals . In fact, Fred Galvin proved the Dinitz conjecture as a special case of his theorem stating that the list chromatic index of any bipartite multigraph is equal to its chromatic index. Moreover, it is also a special case of the edge list coloring conjecture saying that the same holds not only for bipartite graphs, but also for any loopless multigraph.".
- Dinitz_conjecture wikiPageExternalLink summary?doi=10.1.1.72.7005.
- Dinitz_conjecture wikiPageID "920110".
- Dinitz_conjecture wikiPageRevisionID "575404570".
- Dinitz_conjecture accessdate "2008-08-17".
- Dinitz_conjecture hasPhotoCollection Dinitz_conjecture.
- Dinitz_conjecture title "Dinitz Problem".
- Dinitz_conjecture urlname "DinitzProblem".
- Dinitz_conjecture subject Category:Combinatorics.
- Dinitz_conjecture subject Category:Graph_coloring.
- Dinitz_conjecture subject Category:Latin_squares.
- Dinitz_conjecture subject Category:Theorems_in_discrete_mathematics.
- Dinitz_conjecture type GeographicalArea108574314.
- Dinitz_conjecture type LatinSquares.
- Dinitz_conjecture type Location100027167.
- Dinitz_conjecture type Object100002684.
- Dinitz_conjecture type PhysicalEntity100001930.
- Dinitz_conjecture type PublicSquare108619620.
- Dinitz_conjecture type Region108630985.
- Dinitz_conjecture type Tract108673395.
- Dinitz_conjecture type YagoGeoEntity.
- Dinitz_conjecture type YagoLegalActorGeo.
- Dinitz_conjecture type YagoPermanentlyLocatedEntity.
- Dinitz_conjecture comment "In combinatorics, the Dinitz conjecture is a statement about the extension of arrays to partial Latin squares, proposed in 1979 by Jeff Dinitz, and proved in 1994 by Fred Galvin.".
- Dinitz_conjecture label "Dinitz conjecture".
- Dinitz_conjecture sameAs m.03p_0m.
- Dinitz_conjecture sameAs Q5278348.
- Dinitz_conjecture sameAs Q5278348.
- Dinitz_conjecture sameAs Dinitz_conjecture.
- Dinitz_conjecture wasDerivedFrom Dinitz_conjecture?oldid=575404570.
- Dinitz_conjecture isPrimaryTopicOf Dinitz_conjecture.