collaborators

2 papers

math.CO2024

Tree Independence Number IV. Even-hole-free Graphs

Maria Chudnovsky, Peter Gartland, Sepehr Hajebi +2

We prove that the tree independence number of every even-hole-free graph is at most polylogarithmic in its number of vertices. More explicitly, we prove that there exists a constan…

math.CO2023

On Induced Versions of Menger's Theorem on Sparse Graphs

Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov

Let and be sets of vertices in a graph . Menger's theorem states that for every positive integer , either there exists a collection of vertex-disjoint paths betwe…