Longest partial transversals in plexes (Q404534)

A \(k\)-protoplex of order \(n\) is a partial Latin square of order \(n\) such that there are in each row and in each column exactly \(k\) filled cells and each symbol occurs \(k\) times. A partial transversal of length \(m\) is a set of \(m\) cells such that no two cells are in the same column and the same row and no two cells contain the same symbol. In the paper, lower and upper bounds on the length of the largest partial transversal in a \(k\)-protoplex are given.