Every beta-bounded n-square has a transversal of size (1 - beta/4 - o(1)) n, findable by a deterministic polynomial-time algorithm.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A note on finding large transversals efficiently
Every beta-bounded n-square has a transversal of size (1 - beta/4 - o(1)) n, findable by a deterministic polynomial-time algorithm.