Publication date
July 1982
DOI Publisher
Published by Elsevier Inc. ISSN
0097-3165Abstract
AbstractIt is proved that every n × n Latin square has a partial transversal of length at least n − 5.53(log n)2
AbstractIt is proved that every n × n Latin square has a partial transversal of length at least n − 5.53(log n)2
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
In 1975 Stein conjectured that in every n×n array filled with the numbers 1,…,n with every number oc...
The full n-Latin square is the n×n array with symbols 1, 2, . . . , n in each cell. In this paper we...
AbstractIt is proved that every n×n Latin square has a partial transversal of length at least n−O(lo...
AbstractIt is proved that every n × n Latin square has a partial transversal of length at least n − ...
AbstractThe notion of partial transversal in a Latin square is defined. A proof is given of the exis...
A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such t...
We define a cover of a Latin square to be a set of entries that includes at least one representative...
AbstractIt is well known that all n×n partial Latin squares with at most n−1 entries are completable...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
Latin squares are two-dimensional patterns of symbols. Studied since the 18th century, they now find...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
In 1975 Stein conjectured that in every n × n array filled with the numbers 1, . . . , n with every...
Ak-plex in a latin square of ordernis a selection of kn entries that includes k representatives from...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
In 1975 Stein conjectured that in every n×n array filled with the numbers 1,…,n with every number oc...
The full n-Latin square is the n×n array with symbols 1, 2, . . . , n in each cell. In this paper we...
AbstractIt is proved that every n×n Latin square has a partial transversal of length at least n−O(lo...
AbstractIt is proved that every n × n Latin square has a partial transversal of length at least n − ...
AbstractThe notion of partial transversal in a Latin square is defined. A proof is given of the exis...
A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such t...
We define a cover of a Latin square to be a set of entries that includes at least one representative...
AbstractIt is well known that all n×n partial Latin squares with at most n−1 entries are completable...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
Latin squares are two-dimensional patterns of symbols. Studied since the 18th century, they now find...
Abstract. A classical question in combinatorics is the following: given a par-tial latin square P, w...
In 1975 Stein conjectured that in every n × n array filled with the numbers 1, . . . , n with every...
Ak-plex in a latin square of ordernis a selection of kn entries that includes k representatives from...
AbstractIn this paper a certain condition on partial latin squares is shown to be sufficient to guar...
In 1975 Stein conjectured that in every n×n array filled with the numbers 1,…,n with every number oc...
The full n-Latin square is the n×n array with symbols 1, 2, . . . , n in each cell. In this paper we...
Add to ORKG