### Abstract

In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. For d ≥ 2, let G _{d} be the set of connected graphs of minimum degree at least d. Let F _{1} and F _{2} be connected graphs and let H be a set of connected graphs. Then {F _{1}, F _{2}} is said to be a forbidden pair for H if every {F _{1}, F _{2}}-free graph in H of sufficiently large order has a 2-factor. Faudree, Faudree and Ryjáček have characterized all the forbidden pairs for the set of 2-connected graphs. We first characterize the forbidden pairs for G _{2}, which is a larger set than the set of 2-connected graphs, and observe a sharp difference between the characterized pairs and those obtained by Faudree, Faudree and Ryjáček. We then consider the forbidden pairs for connected graphs of large minimum degree. We prove that if {F _{1}, F _{2}} is a forbidden pair for G _{d}, then either F _{1} or F _{2} is a star of order at most d + 2. Ota and Tokuda have proved that every K _{1,}, ⌊d+2/2⌋-free graph of minimum degree at least d has a 2-factor. These results imply that for k ≥ d + 2, no connected graphs F except for stars of order at most d + 2 make {K _{1,k}, F} a forbidden pair for G _{d}, while for k≤ ⌊d+2/2⌋ every connected graph F makes {K _{1,k}, F} a forbidden pair for G _{d}. We consider the remaining range of ⌊ d + 2/2⌋ < k < d+2, and prove that only a finite number of connected graphs F make {K _{1,k}, F} a forbidden pair for G _{d}.

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

Pages (from-to) | 149-158 |

Number of pages | 10 |

Journal | Combinatorics Probability and Computing |

Volume | 21 |

Issue number | 1-2 |

DOIs | |

Publication status | Published - 2012 Jan |

### Fingerprint

### ASJC Scopus subject areas

- Applied Mathematics
- Theoretical Computer Science
- Computational Theory and Mathematics
- Statistics and Probability

### Cite this

*Combinatorics Probability and Computing*,

*21*(1-2), 149-158. https://doi.org/10.1017/S0963548311000514

**A pair of forbidden subgraphs and 2-factors.** / Fujisawa, Jun; Saito, Akira.

Research output: Contribution to journal › Article

*Combinatorics Probability and Computing*, vol. 21, no. 1-2, pp. 149-158. https://doi.org/10.1017/S0963548311000514

}

TY - JOUR

T1 - A pair of forbidden subgraphs and 2-factors

AU - Fujisawa, Jun

AU - Saito, Akira

PY - 2012/1

Y1 - 2012/1

N2 - In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. For d ≥ 2, let G d be the set of connected graphs of minimum degree at least d. Let F 1 and F 2 be connected graphs and let H be a set of connected graphs. Then {F 1, F 2} is said to be a forbidden pair for H if every {F 1, F 2}-free graph in H of sufficiently large order has a 2-factor. Faudree, Faudree and Ryjáček have characterized all the forbidden pairs for the set of 2-connected graphs. We first characterize the forbidden pairs for G 2, which is a larger set than the set of 2-connected graphs, and observe a sharp difference between the characterized pairs and those obtained by Faudree, Faudree and Ryjáček. We then consider the forbidden pairs for connected graphs of large minimum degree. We prove that if {F 1, F 2} is a forbidden pair for G d, then either F 1 or F 2 is a star of order at most d + 2. Ota and Tokuda have proved that every K 1,, ⌊d+2/2⌋-free graph of minimum degree at least d has a 2-factor. These results imply that for k ≥ d + 2, no connected graphs F except for stars of order at most d + 2 make {K 1,k, F} a forbidden pair for G d, while for k≤ ⌊d+2/2⌋ every connected graph F makes {K 1,k, F} a forbidden pair for G d. We consider the remaining range of ⌊ d + 2/2⌋ < k < d+2, and prove that only a finite number of connected graphs F make {K 1,k, F} a forbidden pair for G d.

AB - In this paper, we consider pairs of forbidden subgraphs that imply the existence of a 2-factor in a graph. For d ≥ 2, let G d be the set of connected graphs of minimum degree at least d. Let F 1 and F 2 be connected graphs and let H be a set of connected graphs. Then {F 1, F 2} is said to be a forbidden pair for H if every {F 1, F 2}-free graph in H of sufficiently large order has a 2-factor. Faudree, Faudree and Ryjáček have characterized all the forbidden pairs for the set of 2-connected graphs. We first characterize the forbidden pairs for G 2, which is a larger set than the set of 2-connected graphs, and observe a sharp difference between the characterized pairs and those obtained by Faudree, Faudree and Ryjáček. We then consider the forbidden pairs for connected graphs of large minimum degree. We prove that if {F 1, F 2} is a forbidden pair for G d, then either F 1 or F 2 is a star of order at most d + 2. Ota and Tokuda have proved that every K 1,, ⌊d+2/2⌋-free graph of minimum degree at least d has a 2-factor. These results imply that for k ≥ d + 2, no connected graphs F except for stars of order at most d + 2 make {K 1,k, F} a forbidden pair for G d, while for k≤ ⌊d+2/2⌋ every connected graph F makes {K 1,k, F} a forbidden pair for G d. We consider the remaining range of ⌊ d + 2/2⌋ < k < d+2, and prove that only a finite number of connected graphs F make {K 1,k, F} a forbidden pair for G d.

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

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

U2 - 10.1017/S0963548311000514

DO - 10.1017/S0963548311000514

M3 - Article

AN - SCOPUS:84859324372

VL - 21

SP - 149

EP - 158

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 1-2

ER -