Induced subdivisions with pinned branch vertices
Combinatorics
2025-04-08 v3
Abstract
We prove that for all and , there exists with the following property. Let be a graph and let be a subgraph of isomorphic to a -subdivision of . Then either contains or as an induced subgraph, or there is an induced subgraph of isomorphic to a proper -subdivision of such that every branch vertex of is a branch vertex of . This answers in the affirmative a question of Lozin and Razgon. In fact, we show that both the branch vertices and the paths corresponding to the subdivided edges between them can be preserved.
Keywords
Cite
@article{arxiv.2308.01502,
title = {Induced subdivisions with pinned branch vertices},
author = {Sepehr Hajebi},
journal= {arXiv preprint arXiv:2308.01502},
year = {2025}
}