{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:25Z","timestamp":1753893865910,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>An $m$-flower in a latin square is a set of $m$ entries which share either a common row, a common column, or a common symbol, but which are otherwise distinct. Two $m$-flowers are disjoint if they share no common row, column or entry. In this paper we give a solution of the intersection problem for disjoint $m$-flowers in latin squares; that is, we determine precisely for which triples $(n,m,x)$ there exists a pair of latin squares of order $n$ whose intersection consists exactly of $x$ disjoint $m$-flowers.<\/jats:p>","DOI":"10.37236\/529","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:53:20Z","timestamp":1578714800000},"source":"Crossref","is-referenced-by-count":2,"title":["The Disjoint $m$-Flower Intersection Problem for Latin Squares"],"prefix":"10.37236","volume":"18","author":[{"given":"James G.","family":"Lefevre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"McCourt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2011,2,21]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p42\/appendix","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v18i1p42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T23:16:18Z","timestamp":1579302978000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v18i1p42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,21]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2011,1,5]]}},"URL":"https:\/\/doi.org\/10.37236\/529","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2011,2,21]]},"article-number":"P42"}}