Induced subdivisions with pinned branch vertices

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…