Induced subdivisions with pinned branch vertices

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We prove that for all r∈N∪{0} and s,t∈N, there exists Ω=Ω(r,s,t)∈N with the following property. Let G be a graph and let H be a subgraph of G isomorphic to a (≤r)-subdivision of KΩ. Then either G contains Kt or Kt,t as an induced subgraph, or there is an induced subgraph J of G isomorphic to a proper (≤r)-subdivision of Ks such that every branch vertex of J is a branch vertex of H. 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.

Original languageEnglish (US)
Article number104072
JournalEuropean Journal of Combinatorics
Volume124
DOIs
StatePublished - Feb 2025
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Induced subdivisions with pinned branch vertices'. Together they form a unique fingerprint.

Cite this