An n × n Latin square has a transversal with at least n−n distinct symbols
نویسندگان
چکیده
منابع مشابه
Embedding a Latin square with transversal into a projective space
Article history: Received 20 May 2010 Available online xxxx
متن کاملA simple proof that a word of length n has at most 2n distinct squares
Fraenkel and Simpson [2] proved that the number of distinct squares in a word of length n is at most 2n. Their proof uses a rather intricate combinatorial result of Crochemore and Rytter [1] concerning the lengths of three squares which are prefixes of each other. The same proof is included also in Lothaire’s second book [4, p.281-2]. We give here a very short direct proof of this important res...
متن کاملA lower bound for the length of a partial transversal in a Latin square
It is proved that every n×n Latin square has a partial transversal of length at least n−O(log n). The previous papers proving these results [including one by the second author] not only contained an error, but were sloppily written and quite difficult to understand. We have corrected the error and improved the clarity.
متن کاملOn the Length of a Partial Independent Transversal in a Matroidal Latin Square
We suggest and explore a matroidal version of the Brualdi Ryser conjecture about Latin squares. We prove that any n × n matrix, whose rows and Columns are bases of a matroid, has an independent partial transversal of length d2n/3e. We show that for any n, there exists such a matrix with a maximal independent partial transversal of length at most n− 1.
متن کاملLatin Squares: Transversals and counting of Latin squares
Author: Jenny Zhang First, let’s preview what mutually orthogonal Latin squares are. Two Latin squares L1 = [aij ] and L2 = [bij ] on symbols {1, 2, ...n}, are said to be orthogonal if every ordered pair of symbols occurs exactly once among the n2 pairs (aij , bij), 1 ≤ i ≤ n, 1 ≤ j ≤ n. Now, let me introduce a related concept which is called transversal. A transversal of a Latin square is a se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1978
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90009-2