On the Induced Matching Problem

  title={On the Induced Matching Problem},
  author={Iyad A. Kanj and Michael J. Pelsmajer and Ge Xia and Marcus Schaefer},
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
22 Citations
18 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 18 references

Introduction to graph theory

  • Douglas B. West
  • 1996
Highly Influential
4 Excerpts

Open problems - strong edge coloring

  • Douglas B. West
  • http://www.math.uiuc.edu/∼west/openp/ strongedge…
  • 2007
1 Excerpt

Manlove , and Michele Zito . On the approximability of the maximum induced matching problem

  • Kiyoshi Hosono
  • J . Discrete Algorithms
  • 2005

Salavatipour . Large induced forests in triangle - free planar graphs

  • R Mohammad
  • Graphs Combin .
  • 2004

Similar Papers

Loading similar papers…