A forbidden pair for quasi 5-contractible edges

Abstract

An edge of a quasi k-connected graph is said to be quasi k-contractible if the contraction of the edge results in a quasi k-connected graph. If every quasi k-connected graph without a quasi k-contractible edge has either H1 or H2 as a subgraph, then an unordered pair of graphs \H1, H2\ is said to be a forbidden pair for quasi k-contractible edges. We prove that \K4-, P5\ is a forbidden pair for quasi 5-contractible edges, where K4- is the graph obtained from K4 by removing just one edge and P5 is the complement of a path on five vertices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…