Geodesic
The disjoint \(m\)-flower intersection problem for Latin squares
The electronic journal of combinatorics, Tome 18 (2011) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/529
Classification : 05B15
Mots-clés : latin square, m-flower, intersection problem 
@article{10_37236_529,
     author = {James G. Lefevre and Thomas A. McCourt},
     title = {The disjoint \(m\)-flower intersection problem for {Latin} squares},
     journal = {The electronic journal of combinatorics},
     year = {2011},
     volume = {18},
     number = {1},
     doi = {10.37236/529},
     zbl = {1213.05025},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/529/}
}
TY  - JOUR
AU  - James G. Lefevre
AU  - Thomas A. McCourt
TI  - The disjoint \(m\)-flower intersection problem for Latin squares
JO  - The electronic journal of combinatorics
PY  - 2011
VL  - 18
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/529/
DO  - 10.37236/529
ID  - 10_37236_529
ER  - 
%0 Journal Article
%A James G. Lefevre
%A Thomas A. McCourt
%T The disjoint \(m\)-flower intersection problem for Latin squares
%J The electronic journal of combinatorics
%D 2011
%V 18
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/529/
%R 10.37236/529
%F 10_37236_529
James G. Lefevre; Thomas A. McCourt. The disjoint \(m\)-flower intersection problem for Latin squares. The electronic journal of combinatorics, Tome 18 (2011) no. 1. doi: 10.37236/529

Cité par Sources :