A pair of forbidden subgraphs and perfect matchings

Shinya Fujita, Ken ichi Kawarabayashi, Claudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H-free if no graph in H is an induced subgraph of G. We completely characterize the set H such that every connected H-free graph of sufficiently large even order has a perfect matching in the following cases. (1)Every graph in H is triangle-free.(2) H consists of two graphs (i.e. a pair of forbidden subgraphs).A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H-free graph of sufficiently large odd order has a near-perfect matching in the above cases.

Original languageEnglish
Pages (from-to)315-324
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Volume96
Issue number3
DOIs
Publication statusPublished - 2006 May

Fingerprint

Forbidden Subgraph
Perfect Matching
Graph in graph theory
Odd
Triangle-free
Induced Subgraph
Connected graph
Vertex of a graph

Keywords

  • Forbidden subgraph
  • Near-perfect matching
  • Perfect matching

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Fujita, S., Kawarabayashi, K. I., Leonardo Lucchesi, C., Ota, K., Plummer, M. D., & Saito, A. (2006). A pair of forbidden subgraphs and perfect matchings. Journal of Combinatorial Theory. Series B, 96(3), 315-324. https://doi.org/10.1016/j.jctb.2005.08.002

A pair of forbidden subgraphs and perfect matchings. / Fujita, Shinya; Kawarabayashi, Ken ichi; Leonardo Lucchesi, Claudio; Ota, Katsuhiro; Plummer, Michael D.; Saito, Akira.

In: Journal of Combinatorial Theory. Series B, Vol. 96, No. 3, 05.2006, p. 315-324.

Research output: Contribution to journalArticle

Fujita, S, Kawarabayashi, KI, Leonardo Lucchesi, C, Ota, K, Plummer, MD & Saito, A 2006, 'A pair of forbidden subgraphs and perfect matchings', Journal of Combinatorial Theory. Series B, vol. 96, no. 3, pp. 315-324. https://doi.org/10.1016/j.jctb.2005.08.002
Fujita S, Kawarabayashi KI, Leonardo Lucchesi C, Ota K, Plummer MD, Saito A. A pair of forbidden subgraphs and perfect matchings. Journal of Combinatorial Theory. Series B. 2006 May;96(3):315-324. https://doi.org/10.1016/j.jctb.2005.08.002
Fujita, Shinya ; Kawarabayashi, Ken ichi ; Leonardo Lucchesi, Claudio ; Ota, Katsuhiro ; Plummer, Michael D. ; Saito, Akira. / A pair of forbidden subgraphs and perfect matchings. In: Journal of Combinatorial Theory. Series B. 2006 ; Vol. 96, No. 3. pp. 315-324.
@article{ed4617846ebd46baa346b32eab8310d1,
title = "A pair of forbidden subgraphs and perfect matchings",
abstract = "In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H-free if no graph in H is an induced subgraph of G. We completely characterize the set H such that every connected H-free graph of sufficiently large even order has a perfect matching in the following cases. (1)Every graph in H is triangle-free.(2) H consists of two graphs (i.e. a pair of forbidden subgraphs).A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H-free graph of sufficiently large odd order has a near-perfect matching in the above cases.",
keywords = "Forbidden subgraph, Near-perfect matching, Perfect matching",
author = "Shinya Fujita and Kawarabayashi, {Ken ichi} and {Leonardo Lucchesi}, Claudio and Katsuhiro Ota and Plummer, {Michael D.} and Akira Saito",
year = "2006",
month = "5",
doi = "10.1016/j.jctb.2005.08.002",
language = "English",
volume = "96",
pages = "315--324",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - A pair of forbidden subgraphs and perfect matchings

AU - Fujita, Shinya

AU - Kawarabayashi, Ken ichi

AU - Leonardo Lucchesi, Claudio

AU - Ota, Katsuhiro

AU - Plummer, Michael D.

AU - Saito, Akira

PY - 2006/5

Y1 - 2006/5

N2 - In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H-free if no graph in H is an induced subgraph of G. We completely characterize the set H such that every connected H-free graph of sufficiently large even order has a perfect matching in the following cases. (1)Every graph in H is triangle-free.(2) H consists of two graphs (i.e. a pair of forbidden subgraphs).A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H-free graph of sufficiently large odd order has a near-perfect matching in the above cases.

AB - In this paper, we study the relationship between forbidden subgraphs and the existence of a matching. Let H be a set of connected graphs, each of which has three or more vertices. A graph G is said to be H-free if no graph in H is an induced subgraph of G. We completely characterize the set H such that every connected H-free graph of sufficiently large even order has a perfect matching in the following cases. (1)Every graph in H is triangle-free.(2) H consists of two graphs (i.e. a pair of forbidden subgraphs).A matching M in a graph of odd order is said to be a near-perfect matching if every vertex of G but one is incident with an edge of M. We also characterize H such that every H-free graph of sufficiently large odd order has a near-perfect matching in the above cases.

KW - Forbidden subgraph

KW - Near-perfect matching

KW - Perfect matching

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

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

U2 - 10.1016/j.jctb.2005.08.002

DO - 10.1016/j.jctb.2005.08.002

M3 - Article

VL - 96

SP - 315

EP - 324

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

IS - 3

ER -