DOIAbstract
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
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
The back circulant latin square of order n is the latin square based on the addition table for the i...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
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...
We define a cover of a Latin square to be a set of entries that includes at least one representative...
The logarithm of the maximum number of transversals over all latin squares of order n is greater tha...
Latin squares are two-dimensional patterns of symbols. Studied since the 18th century, they now find...
Let P be a partial latin square of prime order p > 7 consisting of three cyclically generated transv...
AbstractRyser conjectured that the number of transversals of a latin square is odd if and only if th...
In this paper it is shown that any partial Latin square of order n can be embedded in a Latin square...
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 ...
A k-protoplex of order n is a partial latin square of order n such that each row and column contains...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
The back circulant latin square of order n is the latin square based on the addition table for the i...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
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...
We define a cover of a Latin square to be a set of entries that includes at least one representative...
The logarithm of the maximum number of transversals over all latin squares of order n is greater tha...
Latin squares are two-dimensional patterns of symbols. Studied since the 18th century, they now find...
Let P be a partial latin square of prime order p > 7 consisting of three cyclically generated transv...
AbstractRyser conjectured that the number of transversals of a latin square is odd if and only if th...
In this paper it is shown that any partial Latin square of order n can be embedded in a Latin square...
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 ...
A k-protoplex of order n is a partial latin square of order n such that each row and column contains...
AbstractIt is shown that if a partial latin square of order n with fewer than n entries has all its ...
The back circulant latin square of order n is the latin square based on the addition table for the i...
It is well known that all n×n partial Latin squares with at most n−1 entries are completable. Our in...
Add to ORKG