Abstract
Denote by SFin(v) the set of all integer pairs (t, s) for which there exist three symmetric Latin squares of order v on the same set having fine structure (t, s). We completely determine the set SFin(2n) for any integer n ≥ 5.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
