Abstract | ||
---|---|---|
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 |
Year | Venue | DocType |
---|---|---|
2011 | ELECTRONIC JOURNAL OF COMBINATORICS | Journal |
Volume | Issue | ISSN |
18 | 1.0 | 1077-8926 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
James G. Lefevre | 1 | 18 | 6.97 |
Thomas A. McCourt | 2 | 2 | 1.48 |