Tree sums of maximal connected spaces (Q1632740)

A topology \(\tau\) on a set \(X\) is called maximal connected if it is not connected, but no strictly finer topology \(\tau^{*} > \tau\) is connected. In this paper, the author first studies facts on maximal, strongly and essentially connected spaces. Then the author considers a new concept called ``tree sum'', which is a certain quotient of a topological sum that preserves the original spaces as subspaces, glues them only at individual points and the overall structure of gluing corresponds to a tree graph. The author examines the properties of tree sums of topological spaces. Moreover, he introduces an alternative description of standard separation axioms, that is based on the existence of continuous maps into special topological spaces, to prove preservation of separation axioms for tree sums. Then the author shows when maximal, strong and essential connectedness are preserved. In the last part of the paper, the author describes the revision of \textit{J. P. Thomas}' characterization [J. Aust. Math. Soc. 8, 700--705 (1968; Zbl 0165.25302)] of finitely generated maximal connected spaces in the language of specialization preorder and graphs. After this revision the author shows that those spaces are exactly \(T_{\frac{1}{2}}\)-compatible tree sums of the Sierpinski space and proposes another method for their visualization. This visualization is less restrictive and deals better with the duality on finitely generated spaces by switching the colors of isolated and closed vertices.