Two-graphs and trees (Q1322216)

A two-graph is a pair \((V,\Omega)\), where \(\Omega\) is a set of 3-element subsets of \(V\) with the property that each 4-element subset of \(V\) contains an even number of members of \(\Omega\). The paper presents two constructions of two-graphs from trees. The first of these provides a simplified and more natural approach to a construction of \textit{J. J. Seidel} and \textit{S. V. Tsaranov} [Bull. Soc. Math. Belg., Sér. A 42, No. 3, 695-711 (1990; Zbl 0736.05048)] and enables the author to answer their question about the two-graphs obtainable by the construction. The paper also briefly describes connections with Tsaranov and Coxeter groups [\textit{S. V. Tsaranov}, Algebras Groups Geom. 6, No. 3, 281-318 (1989; Zbl 0702.20020)] and with countable homogeneous structures [the author, Q. J. Math., Oxf. II. Ser. 38, 155-183 (1987; Zbl 0628.05039)].