I. Maier

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Tree-independence number VIII. 3PC-free graphs have logarithmic tree-independence number

Maria Chudnovsky, Julien Codsi, Ajaykrishnan E S +2

A three-path-configuration is a graph consisting of three pairwise internally vertex-disjoint paths, the union of every two of which is an induced cycle of length at least four. A…

math.CO2026

Finding non-bisimplicial and triad-free minimal separators

Maria Chudnovsky, Ilya Maier

A $u - v$ separator in $G$ is a set $S \subseteq V (G) ∖ {u, v}$ such that there is no $u - v$ path in $G ∖ S$ . A minimal separator in $G$ is a set $S$ such t…

math.CO2026

Induced Cycles of Many Lengths

Maria Chudnovsky, Ilya Maier

Let $G$ be a graph and let $cl (G)$ be the number of distinct induced cycle lengths in $G$ . We show that for $c, t \in N$ , every graph $G$ that does not contain an in…