Avoidability beyond paths

08/26/2022
by   Vladimir Gurvich, et al.
0

The concept of avoidable paths in graphs was introduced by Beisegel, Chudnovsky, Gurvich, Milanič, and Servatius in 2019 as a common generalization of avoidable vertices and simplicial paths. In 2020, Bonamy, Defrain, Hatzel, and Thiebaut proved that every graph containing an induced path of order k also contains an avoidable induced path of the same order. They also asked whether one could generalize this result to other avoidable structures, leaving the notion of avoidability up to interpretation. In this paper we address this question: we specify the concept of avoidability for arbitrary graphs equipped with two terminal vertices and provide both positive and negative results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2019

Avoidable Vertices and Edges in Graphs

A vertex in a graph is simplicial if its neighborhood forms a clique. We...
research
08/03/2020

Shifting paths to avoidable ones

An extension of an induced path P in a graph G is an induced path P' suc...
research
04/19/2023

Sparse graphs without long induced paths

Graphs of bounded degeneracy are known to contain induced paths of order...
research
06/11/2020

Between Broadway and the Hudson

A substantial generalization of the equinumeracy of grand-Dyck paths and...
research
07/30/2020

Down-step statistics in generalized Dyck paths

The number of down-steps between pairs of up-steps in k_t-Dyck paths, a ...
research
01/11/2022

Long induced paths in minor-closed graph classes and beyond

In this paper we show that every graph of pathwidth less than k that has...
research
04/18/2018

On bounds on bend number of classes of split and cocomparability graphs

A k-bend path is a rectilinear curve made up of k + 1 line segments. A B...

Please sign up or login with your details

Forgot password? Click here to reset