A note on the largest induced matching in graphs avoiding a fixed bipartite graph
Ben Lund, Daniel Reichman·2020-06-05·via math.CO updates on arXiv.org
We give a simple proof that every $n$-vertex graph $d$-regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size $Ω((n/d)(\log d))$.