Back to Search
Start Over
INDUCED MATCHINGS IN GRAPHS OF BOUNDED MAXIMUM DEGREE.
- Source :
-
SIAM Journal on Discrete Mathematics . 2016, Vol. 30 Issue 3, p1876-1882. 7p. - Publication Year :
- 2016
-
Abstract
- For a graph G, let vs(G) be the size of a largest induced matching of G. We prove that vs(G) ≥ n(G)/(⌈Δ/2⌇+1)(⌈Δ/2⌇+1) for every graph of sufficiently large maximum degree Δ and without isolated vertices. This bound is sharp. Moreover, there is a polynomial-time algorithm which computes induced matchings of the size stated above. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MATCHING theory
*GRAPH theory
*BOUNDED arithmetics
*GEOMETRIC vertices
*POLYNOMIALS
Subjects
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 30
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 119816865
- Full Text :
- https://doi.org/10.1137/16M1058078