Browsing Waterloo Research by Subject "trees"
Now showing items 1-1 of 1
-
Pure Pairs. IX. Transversal Trees
(Society for Industrial and Applied Mathematics, 2024)Fix k>0, and let G be a graph, with vertex set partitioned into k subsets ("blocks") of approximately equal size. An induced subgraph of G is "transversal" (with respect to this partition) if it has exactly one vertex in ...