math.CO — Combinatorics
A graph with three card types and five vertex orbits
We prove that the answer to part~(b) of Problem~20.71 of the Kourovka Notebook is yes: there is a connected graph on vertices with exactly three isomorphism types of vertex-deleted subgraphs whose automorphism group has five orbits on the vertices. The graph is a Cayley graph of a Suzuki -group of order with one vertex removed.
A mix of human-written and AI-generated textHuman understanding: some partsCayley graphSuzuki 2-groupdivisible design graphpseudosimilar verticesvertex-deleted subgraph