The disjoint m-flower intersection problem

JG Lefevre, TA McCourt

Research output: Contribution to journalArticle (Academic Journal)peer-review

2 Citations (Scopus)

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.
Translated title of the contributionThe disjoint m-flower intersection problem
Original languageEnglish
Pages (from-to)42 - 74
Number of pages33
JournalElectronic Journal of Combinatorics
Volume18, number 1
Publication statusPublished - Feb 2011

Bibliographical note

Publisher: Australian Mathematical Society

Fingerprint Dive into the research topics of 'The disjoint m-flower intersection problem'. Together they form a unique fingerprint.

Cite this