S. AjaykrishnanE.

works on

algorithmic graph theory 1 graph decomposition 1 induced minors 1 structural graph theory 1 tree independence 1

From the 1 of 6 linked papers with an AI index.

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

The paper shows that any graph either contains a large complete bipartite graph or a large wall as an induced minor, or else its tree‑independence number grows sub‑polynomially, le…

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

(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, I ¨ )$ where $T$ is a tree and $Ï: V(T) \rightarrow 2^{V(G)}…