Intersection density of cubic symmetric graphs

Two elements g, h of a permutation group G acting on a set V are said to be intersecting if g(v)=h(v)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$g(v) = h(v)$$\end{document} for some v∈V\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v \in V$$\end{document}. More generally, a subset F\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {F}$$\end{document} of G is an intersecting set if every pair of elements of F\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {F}$$\end{document} is intersecting. The intersection density ρ(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho (G)$$\end{document} of a transitive permutation group G is the maximum value of the quotient |F|/|Gv|\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|\mathcal {F}|/|G_v|$$\end{document} where F\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {F}$$\end{document} runs over all intersecting sets in G and Gv\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_v$$\end{document} is the stabilizer of v∈V\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$v \in V$$\end{document}. A vertex-transitive graph X is intersection density stable if any two transitive subgroups of Aut(X)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textrm{Aut}}\,(X)$$\end{document} have the same intersection density. This paper studies the above concepts in the context of cubic symmetric graphs. While a 1-regular cubic symmetric graph is necessarily intersection density stable, the situation for 2-arc-regular cubic symmetric graphs is more complex. A necessary condition for a 2-arc-regular cubic symmetric graph admitting a 1-arc-regular subgroup of automorphisms to be intersection density stable is given, and an infinite family of such graphs is constructed.


Introductory remarks
The Erdős-Ko-Rado theorem [9], one of the central results in extremal combinatorics, which gives a bound on the size of a family of intersecting k-subsets of a set and classifies the families satisfying the bound, has been extended in various ways. This paper is concerned with an extension of this theorem to the ambient of transitive permutation groups and vertex-transitive graphs.
For a finite set V let Sym(V ) denote the corresponding symmetric group, and if |V | = n, the notation S n will be adopted. Given a permutation group G ≤ Sym(V ), two elements g, h ∈ G are said to be intersecting if there exists v ∈ V such that g(v) = h(v). We will use the notation g ∩ h in this case. Further, a subset F of G is called intersecting if every two elements of F are intersecting. The intersection density ρ(F) of the intersecting set F is defined to be the quotient where G v is the point stabilizer of v ∈ V , and the intersection density ρ(G) (see [15,17,18,21]) of a group G, is the maximum value of ρ(F) where F runs over all intersecting sets in G.
Clearly, every coset gG v , v ∈ V and g ∈ G, is an intersecting set, referred to as a canonical intersecting set. Consequently, ρ(G) ≥ 1. We say that G has the Erdős-Ko-Rado property (in short EKR-property), if the size of a maximum intersecting set is equal to the order of the largest point stabilizer, and is said to have the strict Erdős-Ko-Rado property (in short strict-EKR-property) if every maximum intersecting set of G is a coset of a point stabilizer. It is clear that strict-EKR-property implies EKRproperty, but the converse does not hold. In particular, if G is transitive then ρ(G) = 1 if and only if the maximum cardinality of an intersecting set is |G|/|V |. Note that if F is an intersecting set of G and f ∈ F then f −1 F is an intersecting set of G (see [14,Proposition 2.3]). Therefore without loss of generality one can consider intersecting sets containing the identity. We will refer to such sets as basic intersecting sets.
Although there are numerous constructions of transitive permutation groups with intersection density greater than 1, such groups remain a hot topic of research. This brings us to the class of transitive permutation groups without regular subgroups. Namely, it is known that regular groups have intersection density equal to 1 [14,Proposition 2.6.], and that the intersection density of a transitive permutation group cannot exceed that of any of its transitive subgroups [20,Lemma 6.5]. Now, moving to vertex-transitive graphs, this means that the above question is for the most part a question about non-Cayley graphs. Namely, there do exist Cayley graphs containing transitive subgroups of automorphisms containing no regular subgroups whose intersection densities are greater than 1 (see Example 2.6). Let us remark that the generalization of the question regarding intersecting sets to the class of all vertex-transitive graphs is indeed a natural one. Namely, the original Erdős-Ko-Rado theorem may be rephrased in a graph-theoretic language as the classification of independent sets of maximal cardinality of the Kneser graphs, see [11]. Of course, the Kneser graphs are vertex-transitive, and therefore a generalization can go in two directions: first, from a special class of vertex-transitive graphs to the whole class of vertex-transitive graphs, and second, from intersecting density of the full automorphism groups to intersection density arrays of the graphs in question.
The intersection density array ρ( ) = [ρ 0 , ρ 1 , ..., ρ k−1 ] of a vertex-transitive graph is defined as a "collection" of increasing intersection densities of transitive subgroups of Aut ( ), that is, for any transitive subgroup G of Aut ( ), we have ρ(G) = ρ i for some i ∈ Z k , with ρ i < ρ i+1 . Furthermore a vertex-transitive graph is said to be intersection density stable if ρ(G) = ρ(H ) for any two transitive subgroups G and H of Aut ( ). In short, if the above array consists of a single item. In particular, in line with the concept of EKR-property of transitive pemutation groups we say that a vertex-transitive graph with intersection density array [1] has the EKR-property. Of particular interest are graphs with non-trivial intersection densities, that is, graphs without the EKR-property. When restricting ourselves to symmetric graphs, that is, arctransitive graphs, we say that the weak intersection density arrayρ( ) of a symmetric graph X is a subarray of ρ( ) consisting only of intersection densities realized by arc-transitive subgroups of Aut ( ). Furthermore, we say that is weakly intersection density stable provided ρ(G) = ρ(H ) for any two arc-transitive subgroups G and H of Aut ( ), and that has the weak EKR-property if its weak intersection density array is equal to [1].
This paper initiates a program aimed at obtaining an understanding, as thorough as possible, of intersection densities of cubic symmetric graphs. (The connectedness of these graphs is tacitly assumed throughout the rest of the paper.) These graphs arise naturally from transitive permutation groups with self-paired suborbits of length 3. This paper is therefore a natural follow-up of [13] where intersection densities of transitive permutation groups with point stabilizers of prime order were studied. In particular, it was proved there that solvable groups with point stabilizers of prime order have the EKR property (see [13,Proposition 4.1]), implying that in our investigation of intersection density stable graphs we may restrict ourselves to non-solvable groups. It is well known that there are 17 types of cubic symmetric graphs. These types are defined with respect to (non)existence of different s-arc-regular subgroups for s ∈ {1, 2, 3, 4, 5} (see Sect. 2). As a starting point of a project aimed at obtaining a deeper understanding of intersection density arrays of cubic symmetric graphs, we choose to consider the subclass of cubic symmetric graphs which admit a 1-arc-regular subgroup of automorphisms. Out of the above-mentioned 17 types of cubic symmetric graphs five contain graphs admitting a 1-arc-regular subgroup of automorphisms: {1}, {1, 2 1 }, {1, 2 1 , 2 2 , 3}, {1, 4 1 } and {1, 4 1 , 4 2 , 5}. Graphs belonging to the latter two are obtained, respectively, as covers of the Heawood graph F14 and the Biggs-Conway graph of order 2.352, and are therefore Cayley graphs. The corresponding Cayley groups are necessary contained in all arc-transitive subgroups with the exception of a 4 2 -arc-regular subgroup, for which the intersection density needs to be computed directly, see Proposition 3.3. In this sense, as far as the intersection density is concerned, the interesting families of graphs are those of types {1}, {1, 2 1 } and {1, 2 1 , 2 2 , 3}. (Throughout the paper the notation FnA, FnB, etc. will refer to the corresponding graphs in the Foster census of all cubic symmetric graphs on up to 512 vertices [3]. For cubic symmetric graphs on more vertices and in the appendix the notation from [4] is used).
The paper is organized as follows. In Sect. 2 we introduce the standard terminology and gather certain results on cubic symmetric graphs needed later on in the paper, and give examples of intersection density arrays for some of these graphs. In Sect. 3 certain properties of intersecting sets in graphs admitting 1-arc-regular actions are singled out. In Sect. 4 a sufficient condition for a cubic symmetric graph of type {1, 2 1 } to be nontrivial weakly intersection density stable is given (see Corollary 4.4). An infinite family of such graphs is also constructed (see Theorem 4.8).
Finally, in the Appendixthe list of all cubic symmetric graphs up to order 2.048 is given together with the following information for each of the graphs: order of the graph, its girth, is it bipartite or not, its type, is it density stable or not, its density array, all transitive subgroups of its automorphism group together with their densities, information if they contain a regular subgroup or not, information on s-arc-regularity in case they act arc-transitively on the graph, and the lengths of consistent cycles. (In the table always indicates a true statement and ⊥ a false statement.) The list was created using Magma [2] and the well-known list of these graphs due to Conder [4]. Computations were based on the fact that the intersecting density of a subgroup can be reduced to finding a maximal sized clique in the corresponding derangement graph. (The derangement graph G = Cay(G, D) is a Cayley graph of a group G with the edge set consisting of all pairs (g, h) ∈ G × G such that gh −1 ∈ D, where D is the set of all fixed-point-free elements (i.e., derangements) of G, see for example [20,21].) In Table 1we summarize all values of intersection density arrays that occur for cubic symmetric graphs of order up to 2.048.

Intersection density arrays of some cubic symmetric graphs
When attempting to gain a thorough understanding of symmetric graphs, it is often helpful to know the structure of vertex-stabilizers and how they act, both locally and globally. In particular, for symmetric cubic graphs the structure of vertex-stabilizers is well known. Tutte proved in two seminal papers [23,24] that every finite symmetric cubic graph is s-arc-regular for some s ≤ 5. Some further insight into the structure of symmetric cubic graphs was given by Djoković and Miller, who proved in [8] that each vertex-stabilizer in an s-arc-regular subgroup of automorphisms of a symmetric cubic graph is isomorphic to Z 3 , S 3 , S 3 × Z 2 , S 4 or S 4 × Z 2 , when s = 1, 2, 3, 4 or 5, respectively. Also, for s ∈ {1, 3, 5} there is just one possibility for edge-stabilizers, while for s ∈ {2, 4} there are two possibilities for edge-stabilizers (see [5,8]). The resulting seven classes of arc-transitive finite group actions on cubic graphs are summarized in Table 2 , where D n denotes the dihedral group of degree n and order 2n (see also [10]). In particular, for s = 2 the edge-stabilizer (of order 4) is isomorphic to either V 4 ∼ = Z 2 × Z 2 or Z 4 , while for s = 4 the edge-stabilizer (of order 16) is isomorphic to either D 8 or the quasi-dihedral group Q D 8 .
More recently, Conder and Nedela [6] proved that there are exactly 17 combinations of the above seven classes realizable by the arc-transitive subgroups of the full automorphism group of a finite cubic symmetric graph X ; see Table 3. For example, a cubic symmetric graph is said to be of type {1, 2 1 , 2 2 , 3} if its automorphism group is 3-arc-regular, admitting two 2-arc-regular subgroups, with respective edge-stabilizers isomorphic to Z 2 × Z 2 and Z 4 , and admitting also a 1-arc-regular subgroup. We now give the intersection density arrays of some well-known cubic symmetric graphs. The computation was done by Magma [2]. We start with the complete bipartite graph K 3,3 , the Petersen graph and the Coxeter graph.

Example 2.1
The complete bipartite graph K 3,3 is a cubic symmetric graph of type {1, 2 1 , 2 2 , 3}. The full automorphism group S 2 3 Z 2 as well as all of its subgroups acting transitively on vertices have intersection density 1, and so K 3,3 is an example of a trivial intersection density stable graph.

Example 2.2
The Petersen graph is a cubic symmetric graph of type {2 1 , 3} with three subgroups of the automorphism group acting transitively on the set of vertices. The full automorphism group S 5 has intersection density 1, while the index 2 subgroup isomorphic to A 5 has intersection density 2. There is a third subgroup of order 20 isomorphic to Z 5 Z 4 with intersection density 1. (For the reference of these results see [14].) The Petersen graph, with intersection density array [1,2], is therefore not intersection density stable.

Example 2.3
The Coxeter graph is a cubic symmetric graph of type {2 2 , 3} with two subgroups of the automorphism group acting transitively on the vertex set. The full automorphism group PGL(2, 7) has intersection density 1, while the index 2 subgroup isomorphic to PSL(2, 7) has intersection density 2, and so the Coxeter graph has intersection density array equal to [1,2] and is not intersection density stable.
In the next two examples, we give intersection density arrays of two non-Cayley cubic symmetric graphs of type {1, 2 1 }. The first one has the intersection density array [1, 4/3], while the second one is intersection density stable and does not have the EKR-property.

Example 2.4
The cubic symmetric graph F220B has order 220 and is of type {1, 2 1 }. The intersection density of the full automorphism group is equal to 1, whereas a 1arc-regular subgroup has intersection density equal to 4/3. Hence this graph is not intersection density stable.

Example 2.5
The cubic symmetric graph F240C has order 240 and is of type {1, 2 1 }. The intersection density of its full automorphism group as well as of the index 2 subgroups is equal to 3. As there are no other transitive subgroups of automorphisms we conclude that this graph is intersection density stable and of course it does not have the EKR property.
The fact that permutation groups which act regularly have intersection density 1, suggests that Cayley graphs are natural candidates for graph with EKR-property. Interestingly, however, there are Cayley graphs which are not intersection density stable, meaning that they have a transitive subgroup of automorphisms with intersection density not equal to 1. Of course this subgroup does not contain a regular subgroup. A classical example is the Kneser graph K (8, 3) of valency 10. In the example below, however, we give a cubic symmetric Cayley graph without the EKR property.

Example 2.6
The cubic symmetric graph F220C has order 220 and is of type {2 1 , 2 2 , 3}. It is a Cayley graph with intersection density array [1,2]. More precisely, both of the two 2-arc-regular subgroups have intersection density 2 while the full automorphism group and, of course, the regular subgroup, have intersection density 1.

Intersecting sets in graphs admitting 1-arc-regular actions
The following is a straightforward generalization of [13, Proposition 5.2]. The proof is omitted (see also [12]).

Proposition 3.1 Let G be a 1-arc-regular group acting on a cubic symmetric graph
, and let F be a basic intersecting set of G containing two elements x and y from different vertex stabilizers of G. Then T = x y, x y −1 x is a normal abelian subgroup of x, y such that x, y /T ∼ = Z 3 . In particular, if (x y) 3 = 1 then x, y is either isomorphic to Z 2 3 or to the unique non-abelian group of order 27 with exponent 3.
For example, in the dodecahedron F20A the 1-arc-regular subgroup (isomorphic to A 5 ) has density 4/3, any maximal basic intersecting set consists of elements {1, x, y, z} where x, y, z are non-commuting elements from different vertex stabilizers such that x, y ∼ = y, z ∼ = z, x ∼ = A 4 . On the other hand, in the cubic symmetric graph C720.5, which is of type {1, 2 1 }, a maximum intersecting set for a 1-arc-regular group has 9 elements while a maximum intersecting set for the full automorphism group has 10 elements. In particular, there exists a basic intersecting set F for the 1-arc-regular In the proof of the next proposition, the concept of rigid cells is needed. These are explored in detail in [7,16]. Given a graph and an automorphism α of let Fix(α) denote the set of all vertices of fixed by α. With the assumption that Fix(α) = ∅ we call the subgraph [Fix(α)] induced on Fix(α) the rigid subgraph of α or, in short, the α-rigid subgraph. Every connected component of [Fix(α)] is referred to as an α-rigid cell. It was proved in [16] that possible rigid cells in cubic symmetric graphs depending on the s-arc-regularity are as shown in Fig. 1.

Proposition 3.2 Let be a cubic symmetric graph whose automorphism group is either 4-arc-regular or 5-arc-regular. Then a transitive subgroup of Aut ( ) is either regular or acts transitively on arcs.
Proof Suppose that there exists a transitive group G in Aut ( ) which is neither arctransitive nor regular. Then G has two edge orbits on consisting of a collection of cycles C of the same length and a 1-matching. But in order for all arcs arising from a cycle C ∈ C to be in the same orbit of G there must exist an involution τ in G fixing C set-wise and as such it has at most two fixed (non-adjacent) vertices on this cycle. Since is 4-arc-regular or 5-arc-regular, it follows by [16,Propositions 3.4. and 3.5.] that every involution must have either an H -tree or an A-tree as a rigid cell. In case of the involution τ , however, a corresponding rigid cell would consist only of a vertex v ∈ V (C) and its third neighbor outside C. Proof Suppose first that is of type {1, 4 1 }. Then, by [6], is a regular cover of the Heawood graph 0 = F14. In view of [14,Lemma 3.1] it suffices to show that ρ( 0 ) = [1]. First, by Proposition 3.2, every transitive subgroup of Aut ( 0 ) is either regular or arc-transitive. In fact, 0 is a Cayley graph of the dihedral group D 14 which is contained in every arc-transitive subgroup of Aut ( 0 ), and the result follows.Similarly, if is of type {1, 4 1 , 4 2 , 5} then, by [6], it is a regular cover of the Biggs-Conway graph 0 of order 2352 [1], which is a Cayley graph and, as was checked by Magma [2], with ρ( 0 ) = [1], and so [14,Lemma 3.1] implies that ρ( ) = [1] as well.

Intersection density stable graphs of type {1, 2 1 }
The next two results will be used in the proof of Theorem 4.3 which gives a sufficient condition for a cubic symmetric graph of type {1, 2 1 } to be weakly intersection density stable.

Lemma 4.1
Let be a cubic symmetric graph admitting a 1-arc-regular subgroup G and a 2-arc-regular subgroup G * such that x ∩ 1 and y ∩ 1 implies x y ∩ 1 whenever x y = yx (x, y ∈ G). (1) If F is a basic intersecting set of G such that F ∪ {p, q}, p, q ∈ G * \ G, is an intersecting set of G * , then pq ∈ C G (F) and F ∪ {pq} is an intersecting set of G.
Proof Observe that in view of the assumptions the elements p, q ∈ G * \G belong to a basic intersecting set of G * and since stabilizers in G * are isomorphic to S 4 it follows that p and q are involutions. We need to show that x ∩ pq for each In particular, since p, q ∈ G * , it follows that pq ∈ G generates a vertex stabilizer isomorphic to Z 3 , and so ( pq) 3 = 1. If x = 1 then to show that x ∩ pq observe that x ∩ p and x ∩ q imply that px ∩ 1 and qx ∩ 1, respectively. Hence px, qx ∈ G * \ G belong to stabilizers and so ( px) 2 = 1 = (qx) 2 . In other words px = x −1 p and qx = x −1 q, and so pq, qp ∈ C G (x). Consequently, (xqp) 3 = x 3 (qp) 3 = 1. Since x ∩ 1 it follows by (2) that the condition (1) is satisfied for y = pq. We conclude that xqp ∩ 1, and so xq ∩ p, and finally x ∩ pq. Therefore F ∪ {pq} is an intersecting set of G.
As a direct consequence of Lemma 4.1 we have the following result. where x 0 = 1 and x 3 i = 1 for every i ∈ Z m , and p 2 i = 1 for every i ∈ Z n . Also, |F| = 6ρ, and furthermore |H | = 3ρ = |P|, for otherwise either F ∩ G or p(F\G) for some p ∈ P would be an intersecting set of G of size greater than 3ρ. Therefore m = 3ρ = n. Clearly n ≥ 4 as ρ(G * ) = 1.
By Corollary 4.2 we have that pq ∈ H for any two elements p, q ∈ P, and since | p P| = n for each p ∈ P, it follows that p P = H for each p ∈ P. Since, by Lemma 4.1, p P ⊆ C G (H ) it follows that every two elements in H commute. We now show that H is in fact an elementary abelian 3-group. Let x, y ∈ H be arbitrary. Then there exists p, q, r such that x = pq and y = pr . Then x −1 y = qr ∈ H , and so H is a subgroup of G, in fact an elementary abelian 3-group. This completes the proof of Theorem 4.3.
The corollary below gives a necessary and sufficient condition for a cubic symmetric graph of type {1, 2 1 } satisfying the condition (1) to be weakly intersection density stable.

Corollary 4.4
Let be a cubic symmetric graph of type {1, 2 1 } admitting a 1-arcregular subgroup G with the full automorphism group G * such that x ∩ 1 and y ∩ 1 implies x y ∩ 1 whenever x y = yx (x, y ∈ G). Then is weakly intersection density stable if and only if ρ(G) = 3 k , k ∈ Z, and there exists a basic intersecting set F of G * which is a group such that As a consequence of Corollary 4.4 we also have the following result. We now give a construction of an infinite family of non-trivial intersection density stable cubic symmetric graphs of type {1, 2 1 }. These graphs arise from the action of the group PSL(2, 3 n ), n ≥ 3, on cosets of Z 3 and satisfy the conditions from Theorem 4.3. The group PSL (2,9) is not considered here because none of its orbitals in the action on cosets of a subgroup of order 3 is self-paired and connected. This is a direct consequence of the fact that, by [19], PSL (2,9) cannot be generated by an involution and an element of order 3, while for n ≥ 3 the group PSL(2, 3 n ) is generated by an involution and an element of order 3. Thus the result below proved in [13], implies the existence of cubic symmetric graphs admitting a 1-arc-regular action of PSL(2, 3 n ) whose intersection density is a power of 3.
For brevity reasons, let X (n) denote a cubic symmetric graph arising from the action of PSL(2, 3 n ), n ≥ 3, given in Proposition 4.6. In Theorem 4.8 below we show that these graphs are non-trivial intersection density stable graphs of type {1, 2 1 }. Lemma 4.7 Let q = 3 n , n ≥ 3, G * = PGL(2, q) and G = PSL(2, q). Then there exist h, a ∈ G and p ∈ G * \ G such that G * = h, a, p : h 3 = a 2 = p 2 = 1, h p = h −1 , ap = pa, . . . and G = h, a : h 3 = a 2 = 1, . . . . Proof By [6] there exists an element h of order 3 and an involution a such that G = h, a . We can choose h to be 1 1 0 1 in view of the fact that for n odd all subgroups of order 3 are conjugate while for n even the two conjugate class of elements order 3 in G merge in G * . As for the involution a = x y z −x to be an element of G we just need that x 2 + yz = ±1. Next, we need to find an involution p ∈ G * \G such that ap = pa and h p = h −1 . It follows that p has to be of the form  Proof The fact that X (n) is a cubic symmetric graph follows from the choice of h, a and p. Also the action of G * is clearly 2-arc-regular and the action of G is 1-arc-regular. Namely, every coset H * x is of the form H * ah ±1 ah ±1 . . . ah ±1 or H * ah ±1 ah ±1 . . . a, and so clearly a multiplication by x −1 ∈ G takes H * x to H * . In order to see that the graph is indeed of type {1, 2 1 } we only need to show that X (n) is not 3-arc-regular. In other words, we need to show that X (n) is not of type {1, 2 1 , 2 2 , 3}. By Conder [6], we have that all cubic symmetric graphs of type {1, 2 1 , 2 2 , 3} are bipartite, while X (n) is not bipartite in view of the fact that G has no subgroup of index 2.
Moreover, X (n) arises also as an orbital graph of the action of G on cosets of H = h , and so we conclude, by Proposition 4.6, that the intersection density of G is equal to [3 n−1 ] if n is odd and to [3 n/2−1 ] if n is even.
It follows by the proof of Proposition 4.6 that the maximum intersecting set F giving rise to the corresponding intersection density of the action of G on H is an elementary abelian 3-group consisting of upper triangle matrices. One can then check that for any element k ∈ F we have pkp = k −1 , and consequently, we can conclude that F ∪ pF is an intersecting set of G * in its action on the costs of H * . Hence ρ(G * ) ≥ ρ(G), and so ρ(G * ) = ρ(G).
To complete the proof of this theorem we just need to show that X (n) does not admit a transitive subgroup of automorphisms with two or three edge orbits on X (n), that is, a transitive subgroup of automorphisms with vertex stabilizer isomorphic to Z 2 or with trivial vertex stabilizer. In both cases this would imply the existence of a subgroup of index 3 in G which is clearly not the case (see, for example, [22,Theorems 6.25 and 6.26]).

Remark 4.9
As for future research of intersection density arrays of cubic symmetric graphs, our first goal should be obtaining a complete description of all possibilities that can occur with respect to intersection density arrays of cubic symmetric graphs of type {1, 2 1 }. In this respect, understanding the relationship between the intersection densities ρ(G) and ρ(G * ) of the 1-arc-regular and 2-arc-regular groups G and G * , respectively, will be needed. We conjecture that it all comes down to essentially three different possibilities. The first possibility covers the situation where ρ(G * ) = max{1, ρ(G)/2}. In other words, a maximal intersecting set of G * is either a vertex stabilizer G * v or it coincides with a maximal intersecting set of G. Second, drawing from Theorem 4.3 and Corollary 4.4 which give a necessary condition for the groups G and G * to have the same intersection density, we hope to be able to complete the intersection density stable end of the spectrum of possible intersection density arrays. Finally, we believe that in all remaining cases a maximal intersecting set of G * consists of a union of a maximal intersecting set of G and a single element from G * \ G, and consequently, ρ(G * ) = ρ(G)/2 + 1/6.

Data availability The manuscript has data included as electronic supplementary material
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.