The three-way intersection problem for Latin squares
Let \(I^3[n]\) be the set of integers \(k\) for which there exist three Latin squares of order \(n\) which have precisely \(k\) cells where all three squares have identical entries and \(n^2-k\) cells where all three squares contain different entries. Further, for integers \(i<j\), let \([i,j]\) denote the set of integers \(\{i,i+1,i+2, \dots, j-1,j\}\). The authors main result is that for \(n\geq 8, I^3[n]=\{0, 1, \dots, n^2-15\} \cup \{n^2-12, n^2-9,n^2\}\). In addition, \(I^3[3]=\{0,9\}; I^3[4]=\{0,1,4,16\}; I^3[5]=[0,7]\cup\{10,25\}; I^3 [6]=[0,19]\cup \{27,36\}; I^3[7]=[0,30]\cup \{37,40,49\}\).
- The 3-way intersection problem for kite systems
- The fine structures of three pairwise distinct Latin squares
- On the simultaneous edge coloring of graphs
- scientific article; zbMATH DE number 4019076 (Why is no real title available?)
- scientific article; zbMATH DE number 5347801 (Why is no real title available?)
- scientific article; zbMATH DE number 26316 (Why is no real title available?)
- The four-way intersection problem for latin squares
- The 3-way flower intersection problem for Steiner triple systems
- scientific article; zbMATH DE number 4198011 (Why is no real title available?)
- Support sizes of threefold quadruple systems
- The disjoint \(m\)-flower intersection problem for Latin squares
- The fine structures of three symmetric Latin squares with even orders
- The fine structures of three Latin squares
- scientific article; zbMATH DE number 5492419 (Why is no real title available?)
- On the volume of -way G-trade
- The spectrum for 3-way \(k\)-homogeneous Latin trades
This page was built for publication: The three-way intersection problem for Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957695)