On the $d$-transversal number of cylindrical and toroidal grids

Hailun Wu, Heping Zhang

For a positive integer $d$, a $d$-transversal set of a graph $G$ is an edge subset $T\subseteq E(G)$ such that $|T\cap M|\ge d$ for every maximum matching $M$ of $G$. The $d$-tran…