Latin cubes of even order with forbidden entries

From MaRDI portal
Publication:2297909




Abstract: We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant gamma>0 such that if n=2t and A is a 3-dimensional nimesnimesn array where every cell contains at most gamman symbols, and every symbol occurs at most gamman times in every line of A, then A is {em avoidable}; that is, there is a Latin cube L of order n such that for every 1leqi,j,kleqn, the symbol in position (i,j,k) of L does not appear in the corresponding cell of A.









This page was built for publication: Latin cubes of even order with forbidden entries

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