Forbidden Pairs with a Common Graph Generating Almost the Same Sets

[摘要] Let $\mathcal{H}$ be a family of connected graphs. A graph $G$ is said to be $\mathcal{H}$-free if $G$ does not contain any members of $\mathcal{H}$ as an induced subgraph. Let $\mathcal{F}(\mathcal{H})$ be the family of connected $\mathcal{H}$-free graph

[学科分类] 离散数学和组合数学

[关键词] Forbidden subgraph;Star-free graph;Vertex-transitive graph