A note on finding large transversals efficiently Anastos, Michael Morris, Patrick In an n×n array filled with symbols, a transversal is a collection of entries with distinct rows, columns and symbols. In this note we show that if no symbol appears more than βn times, the array contains a transversal of size (1−β/4−o(1))n . In particular, if the array is filled with n symbols, each appearing n times (an equi- n square), we get transversals of size (3/4−o(1))n. Moreover, our proof gives a deterministic algorithm with polynomial running time, that finds these transversals. Wiley 2025 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/19798 Anastos M, Morris P. A note on finding large transversals efficiently. <i>Journal of Combinatorial Designs</i>. 2025;33(9):338-342. doi:<a href="https://doi.org/10.1002/jcd.21990">10.1002/jcd.21990</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1002/jcd.21990 info:eu-repo/semantics/altIdentifier/issn/1063-8539 info:eu-repo/semantics/altIdentifier/e-issn/1520-6610 info:eu-repo/semantics/altIdentifier/wos/001495472300001 info:eu-repo/semantics/altIdentifier/arxiv/2412.05891 info:eu-repo/semantics/openAccess