A forbidden pair for quasi 5-contractible edges
Combinatorics
2025-08-13 v1
Abstract
An edge of a quasi -connected graph is said to be quasi -contractible if the contraction of the edge results in a quasi -connected graph. If every quasi -connected graph without a quasi -contractible edge has either or as a subgraph, then an unordered pair of graphs is said to be a forbidden pair for quasi -contractible edges. We prove that is a forbidden pair for quasi 5-contractible edges, where is the graph obtained from by removing just one edge and is the complement of a path on five vertices.
Keywords
Cite
@article{arxiv.2508.08563,
title = {A forbidden pair for quasi 5-contractible edges},
author = {Shuai Kou and Weihua Yang and Mingzu Zhang and Shuang Zhao},
journal= {arXiv preprint arXiv:2508.08563},
year = {2025}
}