Maria Chudnovsky

collaborators

3 papers

math.CO2025

Tree independence number V. Walls and claws

Maria Chudnovsky, Julien Codsi, Daniel Lokshtanov +2

Given a family $H$ of graphs, we say that a graph $G$ is $H$ -free if no induced subgraph of $G$ is isomorphic to a member of $H$ . Let $S_{t, t, t}$ be t…

math.CO2025

Strictly Metrizable Graphs are Minor-Closed

Maria Chudnovsky, Daniel Cizma, Nati Linial

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$ . A path system is said to be consistent if it is intersecti…

math.CO2024

Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth

Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl

The pathwidth of a graph $G$ is the smallest $w \in N$ such that $G$ can be constructed from a sequence of graphs, each on at most $w + 1$ vertices, by gluing them together i…