Abstract
In this paper, we show that the set of all integers n⩾4 is the spectrum of two mutually orthogonal holey Latin squares, of type 2n, in which one square is symmetric. As an application, we determine the maximum number of pairwise edge disjoint copies of G7 in Kv for each v, and all possible graphs that arise from the unused edges.
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.
