### Abstract

Let F be a family of connected graphs. A graph G is said to be F-free if G is H-free for every graph H in F. Fujita et al. (2006) [2] studied the problem of characterizing the families of graphs F such that every large enough connected F-free graph of odd order has a near perfect matching. In the same work, the authors characterized such families F, but in the case where every graph in F is triangle-free. In this paper, we complete the characterization of all such families, removing the triangle-free condition.

Original language | English |
---|---|

Pages (from-to) | 1267-1280 |

Number of pages | 14 |

Journal | Discrete Mathematics |

Volume | 313 |

Issue number | 11 |

DOIs | |

Publication status | Published - 2013 |

### Fingerprint

### Keywords

- Forbidden subgraph
- Near perfect matching
- Perfect matching

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*313*(11), 1267-1280. https://doi.org/10.1016/j.disc.2013.01.020

**Forbidden induced subgraphs for near perfect matchings.** / Ota, Katsuhiro; Ozeki, Kenta; Sueiro, Gabriel.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 313, no. 11, pp. 1267-1280. https://doi.org/10.1016/j.disc.2013.01.020

}

TY - JOUR

T1 - Forbidden induced subgraphs for near perfect matchings

AU - Ota, Katsuhiro

AU - Ozeki, Kenta

AU - Sueiro, Gabriel

PY - 2013

Y1 - 2013

N2 - Let F be a family of connected graphs. A graph G is said to be F-free if G is H-free for every graph H in F. Fujita et al. (2006) [2] studied the problem of characterizing the families of graphs F such that every large enough connected F-free graph of odd order has a near perfect matching. In the same work, the authors characterized such families F, but in the case where every graph in F is triangle-free. In this paper, we complete the characterization of all such families, removing the triangle-free condition.

AB - Let F be a family of connected graphs. A graph G is said to be F-free if G is H-free for every graph H in F. Fujita et al. (2006) [2] studied the problem of characterizing the families of graphs F such that every large enough connected F-free graph of odd order has a near perfect matching. In the same work, the authors characterized such families F, but in the case where every graph in F is triangle-free. In this paper, we complete the characterization of all such families, removing the triangle-free condition.

KW - Forbidden subgraph

KW - Near perfect matching

KW - Perfect matching

UR - http://www.scopus.com/inward/record.url?scp=84887125269&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887125269&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2013.01.020

DO - 10.1016/j.disc.2013.01.020

M3 - Article

AN - SCOPUS:84887125269

VL - 313

SP - 1267

EP - 1280

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 11

ER -