Separating rank 3 graphs

Research output: Contribution to journalArticlepeer-review


We classify, up to some notoriously hard cases, the rank 3 graphs which fail to meet either the Delsarte or the Hoffman bound. As a consequence, we resolve the question of separation for the corresponding rank 3 primitive groups and give new examples of synchronising, but not QI, groups of affine type.

Original languageEnglish
Article number103732
Number of pages13
JournalEuropean Journal of Combinatorics
Publication statusPublished - Aug 2023


Dive into the research topics of 'Separating rank 3 graphs'. Together they form a unique fingerprint.

Cite this