Peter Gartland

collaborators

3 papers

cs.DS2025

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time

Peter Gartland, Daniel Lokshtanov, TomÃ¡Å¡ MasaÅÃk +3

We show that the Maximum Weight Independent Set problem (MWIS) can be solved in quasi-polynomial time on $H$ -free graphs (graphs excluding a fixed graph $H$ as an induced subgraph)…

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\…