Martin Milanič gave an online talk on a variation of tree-width of graphs by measuring the width of a tree-decomposition by the size of the largest stable set in a bag at the Virtual Discrete Math Colloquium

On November 5, 2021, Martin Milanič from the University of Primorska, Slovenia gave an online talk at the Virtual Discrete Math Colloquium on a variation of tree-width by measuring the width of a tree-decomposition by the size of the largest stable set in a bag and its algorithmic applications to the maximum weight stable set. The title of his talk was “Tree Decompositions with Bounded Independence Number“.