most citedTight bound for the Erdős-Pósa property of tree minors

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2025

Separation Number and Treewidth, Revisited

Hussein Houdrouge, Babak Miraftab, Pat Morin

We give a constructive proof of the fact that the treewidth of a graph is bounded by a linear function of the separation number of .

math.CO2024★ 1 cited

Tight bound for the Erdős-Pósa property of tree minors

Vida Dujmović, Gwenaël Joret, Piotr Micek +1

Let be a tree on vertices. We prove that for every positive integer and every graph , either contains pairwise vertex-disjoint subgraphs each having a mi…