S. AjaykrishnanE.

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Induced-Minor-Closed Classes have Linear, Square-Root, or Sub-Polynomial Tree-Independence

Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S +1

An independent set in a graph $G$ is a set of pairwise non-adjacent vertices. A tree decomposition of $G$ is a pair $(T, χ)$ where $T$ is a tree and $χ : V (T) \to 2^{V (G)}$ …

math.CO2026

Induced Minors and Coarse Tree Decompositions

Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S +1

Let $G$ be a graph, $S \subseteq V (G)$ be a vertex set in $G$ and $r$ be a positive integer. The distance $r$ -independence number of $S$ is the size of the largest subset $I \subse…

math.CO2025

(Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence

Maria Chudnovsky, Ajaykrishnan E S, Daniel Lokshtanov

An independent set in a graph $G$ is a set of pairwise non-adjacent vertices. A tree decomposition of $G$ is a pair $(T, χ)$ where $T$ is a tree and $χ : V (T) \to 2^{V (G)}$ …