ON GROUPS OF DEGREE n AND 71-1, AND HIGHLY-SYMMETRIC EDGE COLOURINGS
نویسنده
چکیده
It is known that, if G is a triply transitive permutation group on a finite set X with a regular normal subgroup N, then |N| = 2 (d ̂ 2) or |N| = 3. (See [12; Theorem 11.3].) If N is a regular normal subgroup of a permutation group G on X, xeX, and Gx is the stabiliser of x, then Gx £ G/JV (as abstract group), and so G has a representation on a set Y such that, for xeX, the representations of Gx on X {*} and Y are equivalent. I show that, with this hypothesis replacing the existence of a regular normal subgroup of a triply transitive group, only one further situation arises:
منابع مشابه
δ-Connectivity in Random Lifts of Graphs
Amit and Linial have shown that a random lift of a connected graph with minimum degree δ > 3 is asymptotically almost surely (a.a.s.) δ-connected and mentioned the problem of estimating this probability as a function of the degree of the lift. Using a connection between a random n-lift of a graph and a randomly generated subgroup of the symmetric group on n-elements, we show that this probabili...
متن کاملAutomorphisms generating disjoint Hamilton cycles in star graphs
In the first part of the thesis we define an automorphism φn for each star graph Stn of degree n − 1, which yields permutations of labels for the edges of Stn taken from the set of integers {1, . . . , bn/2c}. By decomposing these permutations into permutation cycles, we are able to identify edge-disjoint Hamilton cycles that are automorphic images of a known two-labelled Hamilton cycle H1 2(n)...
متن کاملA Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in terms of the monomial symmetric functions, mλ, and present various correlation properties which exist between the two-parameter chromatic symmetric function and its corresponding graph. Additionally, for the complete gr...
متن کاملNear Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group
In this paper we investigate simulations of hypercube networks by certain Cayley graphs on the symmetric group. Let Q(k) be the familiar k-dimensional hypercube, and let S(n) be the star network of dimension n defined as follows. The vertices of S(n) are the elements of the symmetric group of degree n, two vertices x and y being adjacent if x°(1,i) = y for some i. That is, xy is an edge if x an...
متن کاملAspects of infinite permutation groups
Until 1980, there was no such subgroup as ‘infinite permutation groups’, according to the Mathematics Subject Classification: permutation groups were assumed to be finite. There were a few papers, for example [10, 62], and a set of lecture notes by Wielandt [72], from the 1950s. Now, however, there are far more papers on the topic than can possibly be summarised in an article like this one. I s...
متن کامل