Avoidable paths in graphs

Abstract : We prove a recent conjecture of Beisegel et al. that for every positive integer k, every graph containing an induced P_k also contains an avoidable P_k. Avoidability generalises the notion of simpliciality best known in the context of chordal graphs. The conjecture was only established for k in {1,2} (Ohtsuki et al. 1976, and Beisegel et al. 2019, respectively). Our result also implies a result of Chv\'atal et al. 2002, which assumed cycle restrictions. We provide a constructive and elementary proof, relying on a single trick regarding the induction hypothesis. In the line of previous works, we discuss conditions for multiple avoidable paths to exist.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02402905
Contributor : Marthe Bonamy <>
Submitted on : Friday, January 17, 2020 - 2:27:23 PM
Last modification on : Monday, January 20, 2020 - 3:08:41 PM

File

1908.03788.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02402905, version 1
  • ARXIV : 1908.03788

Citation

Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut. Avoidable paths in graphs. 2020. ⟨hal-02402905⟩

Share

Metrics

Record views

30

Files downloads

2