Two-graphs and trees

Peter J. Cameron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


Tsaranov has associated to each two-graph a group generated by elements of order 3. He and Seidel define a map from trees to two-graphs; the Tsaranov group of a two-graph in the image of this map is the even subgroup of the Coxeter group of the tree. In this paper, I will give a simplified account of the map, and also settle a question raised by Seidel and Tsaranov, by characterising the two-graphs in the image of the map (and also a related class of graphs) by forbidden substructures. I also describe a different map from trees to two-graphs, characterise its image by excluded substructures, and use this to give an alternative proof of the first characterisation. Connections with Tsaranov and Coxeter groups, and with countable homogeneous structures, are briefly described.

Original languageEnglish
Pages (from-to)63-74
Number of pages12
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 15 Mar 1994


Dive into the research topics of 'Two-graphs and trees'. Together they form a unique fingerprint.

Cite this