Abstract

In this paper a certain condition on partial latin squares is shown to be sufficient to guarantee that the partial square can be completed, namely, that it have fewer than n entries, and that at most [ (n + 1) 2 ] of these lie off some line, where n is the order of the square. This is applied to establish that the Evans conjecture is true for n ⩽ 8; i.e., that given a partial latin square of order n with fewer than n entries, n ⩽ 8, the square can be completed. Finally, the results are viewed in a conjugate way to establish different conditions sufficient for the completion of a partial latin square.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.