activity
20242026
most citedLinked tree-decompositions into finite parts

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

collaborators
Showing 2025Show all

2 papers · 1 filter

math.CO2025

Displaying prescribed sets of ends by linked tree-decompositions

Sandra Albrechtsen, Max Pitz, Roman Schaut

We show that if a subset of the ends of a graph can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decompositi…

math.CO2025

All graphs are majority 3-choosable

Jan Ouborny, Max Pitz

Every graph is majority 3-choosable. This generalises the result by Shelah-Milner that every graph has an unfriendly 3-partition, confirming a conjecture of Haslegrave from 2020.