Conjecture on Dinitz problem and improvement of Hrnčiar's result

MaRDI QIDQ5166226zbMATH OpenFDO

Authors Michal Ivaška, Miroslav Haviar

Publication date 25 June 2014

Full work available at URL http://actamath.savbb.sk/acta2104.shtml

zbMATH Keywords

Dinitz problemdirected graphgood choicegraph kernelLatin square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30)

Recommendations

• The Dinitz problem solved for rectangles
• On the relations of various conjectures on Latin squares and straightening coefficients
• Towards a solution of the Dinitz problem?
• On the Dinitz conjecture and related conjectures
• scientific article; zbMATH DE number 3735847

Cited in

(2)

• scientific article; zbMATH DE number 169443 (Why is no real title available?)
• The Dinitz problem solved for rectangles

This page was built for publication: Conjecture on Dinitz problem and improvement of Hrnčiar's result

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166226)