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
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such t...
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...
We define a cover of a Latin square to be a set of entries that includes at least one representative...
AbstractRyser conjectured that the number of transversals of a latin square is odd if and only if th...
Latin squares are two-dimensional patterns of symbols. Studied since the 18th century, they now find...
In this paper it is shown that any partial Latin square of order n can be embedded in a Latin square...
The logarithm of the maximum number of transversals over all latin squares of order n is greater tha...
Ak-plex in a latin square of ordernis a selection of kn entries that includes k representatives from...
Let P be a partial latin square of prime order p > 7 consisting of three cyclically generated transv...
A k-protoplex of order n is a partial latin square of order n such that each row and column contains...
In this note, we show that for each Latin square L of order n≥2 , there exists a Latin square L’≠L o...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such t...
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...
We define a cover of a Latin square to be a set of entries that includes at least one representative...
AbstractRyser conjectured that the number of transversals of a latin square is odd if and only if th...
Latin squares are two-dimensional patterns of symbols. Studied since the 18th century, they now find...
In this paper it is shown that any partial Latin square of order n can be embedded in a Latin square...
The logarithm of the maximum number of transversals over all latin squares of order n is greater tha...
Ak-plex in a latin square of ordernis a selection of kn entries that includes k representatives from...
Let P be a partial latin square of prime order p > 7 consisting of three cyclically generated transv...
A k-protoplex of order n is a partial latin square of order n such that each row and column contains...
In this note, we show that for each Latin square L of order n≥2 , there exists a Latin square L’≠L o...
AbstractLet P be a partial latin square of prime order p>7 consisting of three cyclically generated ...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
A latin square of order n is an n by n array whose entries are drawn from an n-set of symbols such t...
DOI
Add to ORKG