Peter Gartland

activity

20182024

most citedFinding large induced sparse subgraphs in

C_{> t}

-free graphs in quasipolynomial time

6 citations · 16 across the 5 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

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.CO2024

Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth

Maria Chudnovsky, Peter Gartland, Sepehr Hajebi +2

We prove that for every integer $t \geq 1$ there exists an integer $c_{t} \geq 1$ such that every $n$ -vertex even-hole-free graph with no clique of size $t$ has treewidth at most $c_t\…