1 problem
Let be integers. Define to be the minimum integer such that every graph with treewidth at least contains pairwise disjoint connected su…
Let be integers. Define to be the minimum integer such that every graph with treewidth at least contains pairwise disjoint connected su…