Abstract
AbstractLet M be an array (), where each of its cells is colored in one of two colors. We give a necessary and sufficient condition for the existence of a partition of M into n diagonals, each containing at least one cell of each color. As a consequence, it follows that if each color appears in at least cells, then such a partition exists. The proof uses results on completion of partial Latin squares.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
