Saved in:
Bibliographic Details
Main Authors: Ge, Wayne, Oxley, James
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2503.20106
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of sufficiently large $2$-connected graphs. In this paper, we establish a dual version of this theorem by focusing on the minors obtained by contracting cycles.