AbstractIt is proved that every n×n Latin square has a partial transversal of length at least n−O(log2n). 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
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
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...
AbstractIt is proved that every n × n Latin square has a partial transversal of length at least n − ...
AbstractIt is proved that every n×n Latin square has a partial transversal of length at least n−O(lo...
AbstractThe notion of partial transversal in a Latin square is defined. A proof is given of the exis...
In 1975 Stein conjectured that in every n × n array filled with the numbers 1, . . . , n with every...
In 1975 Stein conjectured that in every n×n array filled with the numbers 1,…,n with every number oc...
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...
In 1975 Stein conjectured that in every n × n array filled with the numbers 1,...,n with every numbe...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
AbstractIn this paper it is shown that every m×n array in which each symbol appears at most (mn-1)/(...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
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...
AbstractIt is proved that every n × n Latin square has a partial transversal of length at least n − ...
AbstractIt is proved that every n×n Latin square has a partial transversal of length at least n−O(lo...
AbstractThe notion of partial transversal in a Latin square is defined. A proof is given of the exis...
In 1975 Stein conjectured that in every n × n array filled with the numbers 1, . . . , n with every...
In 1975 Stein conjectured that in every n×n array filled with the numbers 1,…,n with every number oc...
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...
In 1975 Stein conjectured that in every n × n array filled with the numbers 1,...,n with every numbe...
A classical question in combinatorics is the following: given a partial Latin square P, when can we ...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
AbstractIn this paper it is shown that every m×n array in which each symbol appears at most (mn-1)/(...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
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...