@article{19798,
  abstract     = {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.},
  author       = {Anastos, Michael and Morris, Patrick},
  issn         = {1520-6610},
  journal      = {Journal of Combinatorial Designs},
  number       = {9},
  pages        = {338--342},
  publisher    = {Wiley},
  title        = {{A note on finding large transversals efficiently}},
  doi          = {10.1002/jcd.21990},
  volume       = {33},
  year         = {2025},
}