2 papers
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.
math.GN2022
Universal end-compactifications of locally finite graphs
Jan Ouborny, Max Pitz
We construct a locally finite connected graph whose Freudenthal compactification is universal for the class of completely regular continua, a class also known in the literature und…