Forbidden induced subgraphs for near perfect matchings

Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)1267-1280
Number of pages14
JournalDiscrete Mathematics
Volume313
Issue number11
DOIs
Publication statusPublished - 2013

Fingerprint

Forbidden Induced Subgraph
Perfect Matching
Triangle-free
Graph in graph theory
Connected graph
Odd
Family

Keywords

  • Forbidden subgraph
  • Near perfect matching
  • Perfect matching

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

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

In: Discrete Mathematics, Vol. 313, No. 11, 2013, p. 1267-1280.

Research output: Contribution to journalArticle

Ota, Katsuhiro ; Ozeki, Kenta ; Sueiro, Gabriel. / Forbidden induced subgraphs for near perfect matchings. In: Discrete Mathematics. 2013 ; Vol. 313, No. 11. pp. 1267-1280.
@article{0d9fbddae6ac4ecdb327ea58939264fa,
title = "Forbidden induced subgraphs for near perfect matchings",
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.",
keywords = "Forbidden subgraph, Near perfect matching, Perfect matching",
author = "Katsuhiro Ota and Kenta Ozeki and Gabriel Sueiro",
year = "2013",
doi = "10.1016/j.disc.2013.01.020",
language = "English",
volume = "313",
pages = "1267--1280",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "11",

}

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 -