All graphs are majority 3-choosable
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.CO↗
arXiv subjects
Jan Ouborny
Publications and source records attributed to Jan Ouborny.
Universal end-compactifications of locally finite graphs
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 under the name thin or graph-like continua.
math.GN↗