The $k$-in-a-tree problem for graphs of girth at least~$k$

Abstract

For all integers $k\ge 3$, we give an $O(n^4)$ time algorithm for the problem whose instance is a graph $G$ of girth at least $k$ together with $k$ vertices and whose question is "Does $G$ contains an induced subgraph containing the $k$ vertices and isomorphic to a tree?". This directly follows for $k=3$ from the three-in-a-tree algorithm of Chudnovsky and Seymour and for $k=4$ from a result of Derhy, Picouleau and Trotignon. Here we solve the problem for $k\ge 5$. Our algorithm relies on a structural description of graphs of girth at least $k$ that do not contain an induced tree covering $k$ given vertices ($k\ge 5$).

References in corpus (2)

• Detecting induced subgraphs
• The four-in-a-tree problem in triangle-free graphs

Cited by in corpus (3)

• Three-in-a-Tree in Near Linear Time
• The (theta, wheel)-free graphs Part IV: induced paths and cycles
• Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths