Separating rank 3 graphs
DOI10.1016/j.ejc.2023.103732zbMath1522.20009arXiv2211.02326OpenAlexW4376120044MaRDI QIDQ6171504
Gordon F. Royle, Michael Giudici, Jesse Lansdown, John Bamberg
Publication date: 18 July 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.02326
strongly regular graphsHoffman boundDelsarte boundsynchronising groupsrank 3 graphsseparating groupsrank 3 primitive groupsseparating graphs
Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Primitive groups (20B15) Group actions on combinatorial structures (05E18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On endomorphisms of alternating forms graph
- On Minkowski space and finite geometry
- New non-existence proofs for ovoids of Hermitian polar spaces and hyperbolic quadrics
- An analogue of the Erdős-Ko-Rado theorem for the distance-regular graphs of bilinear forms
- The structure of finitary permutation groups
- A classification of one-dimensional affine rank three graphs
- On maximal cliques of Cayley graphs over fields
- The Hall-Paige conjecture, and synchronization for affine and diagonal groups
- Between primitive and 2-transitive: synchronization and its friends
- Synchronization and separation in the Johnson schemes
- Hoffman's ratio bound
- Pseudo-random properties of self-complementary symmetric graphs
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- The Rank 3 Permutation Representations of the Finite Classical Groups
- The Finite Primitive Permutation Groups of Rank Three
- The Affine Permutation Groups of Rank Three
- Finite Permutation Groups and Finite Simple Groups
- On the orbit-sizes of permutation groups containing elements separating finite subsets
- On 2-closures of rank 3 groups
- Strongly Regular Graphs
- Permutation representations and rational irreducibility
- CORES OF SYMMETRIC GRAPHS
This page was built for publication: Separating rank 3 graphs