Highly Influenced

# On the Induced Matching Problem

@inproceedings{Kanj2008OnTI, title={On the Induced Matching Problem}, author={Iyad A. Kanj and Michael J. Pelsmajer and Ge Xia and Marcus Schaefer}, booktitle={STACS}, year={2008} }

- Published 2008 in STACS
DOI:10.4230/LIPIcs.STACS.2008.1361

We study extremal questions on induced matchings in several natural graph classes. We argue that these questions should be asked for twinless graphs, that is graphs not containing two vertices with the same neighborhood. We show that planar twinless graphs always contain an induced matching of size at least n/40 while there are planar twinless graphs that do not contain an induced matching of size (n + 10)/27. We derive similar results for outerplanar graphs and graphs of bounded genus. Theseâ€¦Â CONTINUE READING

#### From This Paper

##### Topics from this paper.

22 Citations

18 References

Similar Papers