A note on the largest induced matching in graphs avoiding a fixed bipartite graph
Combinatorics
2020-09-22 v2
Abstract
We give a simple proof that every -vertex graph -regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size .
Cite
@article{arxiv.2006.03225,
title = {A note on the largest induced matching in graphs avoiding a fixed bipartite graph},
author = {Ben Lund and Daniel Reichman},
journal= {arXiv preprint arXiv:2006.03225},
year = {2020}
}