Agile Sets in Graphs
Combinatorics
2025-05-20 v1
Abstract
A set of vertices in a graph is agile if, however we partition the set into two parts, we can always find two vertex-disjoint connected subgraphs where one covers the first and the other the second part. We present a characterization for the existence of large agile sets in terms of and large strip minors.
Keywords
Cite
@article{arxiv.2109.04768,
title = {Agile Sets in Graphs},
author = {Christian Elbracht and Jay Lilian Kneip and Maximilian Teegen},
journal= {arXiv preprint arXiv:2109.04768},
year = {2025}
}
Comments
20 pages, 3 figures