6-Transitive graphs

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, methodology): “The results of [19] and [11], classifying 5-isoregular graphs to a few trivial cases, and proving that 5-isoregular graphs are k-isoregular for all k, in part supported the conjecture that the k-dim WL method might, with k some small constant, suffice to classify all graphs.”
An optimal lower bound on the number of variables for graph identification (1989, background): “The second hope was partly based on the following result of Cameron [14], obtained independently by Gol’fand (cf.”
An optimal lower bound on the number of variables for graph identification (1992, background): “Cameron and Gol'fand have shown that apart from the pentagon and the line graph of K(3,3), only the trivial examples of 5-regular graphs exist, namely the disjoint unions of complete graphs of equal size, and their complements (complete multipartite graphs).”