P. T. de Lima

collaborators

3 papers

math.CO2026

An Erdős-Pósa theorem for induced packings of even cycles

Jungho Ahn, Lars Jaffke, O-joung Kwon +2

We show that for every graph $G$ and every positive integer $k$ , $G$ contains either $k$ vertex-disjoint even cycles with no edges between distinct cycles, or a set of $O(k^2\log k…

cs.DS2026

Odd Cycle Transversal on $H$ -free graphs

Esther Galby, Paloma T. de Lima, Andrea Munaro +1

\textsc{Odd Cycle Transversal} is a classic $NP$ -hard graph optimization problem asking for a minimum-weight set of vertices whose deletion makes the input graph bipartite…

cs.DS2024

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Paloma T. Lima, Martin Milanič, Peter Muršič +3

For a tree decomposition $T$ of a graph $G$ , by $μ (T)$ we denote the size of a largest induced matching in $G$ all of whose edges intersect one bag of $\mathcal…

An Erdős-Pósa theorem for induced packings of even cycles

Odd Cycle Transversal on H-free graphs

Tree decompositions meet induced matchings: beyond Max Weight Independent Set

Odd Cycle Transversal on $H$ -free graphs