On complete multipartite derangement graphs

From MaRDI portal
Publication:5013345




Abstract: Given a finite transitive permutation group GleqoperatornameSym(Omega), with |Omega|geq2, the derangement graph GammaG of G is the Cayley graph operatornameCay(G,operatornameDer(G)), where operatornameDer(G) is the set of all derangements of G. Meagher et al. [On triangles in derangement graphs, {it J. Combin. Theory Ser. A}, 180:105390, 2021] recently proved that operatornameSym(2) acting on 1,2 is the only transitive group whose derangement graph is bipartite and any transitive group of degree at least three has a triangle in its derangement graph. They also showed that there exist transitive groups whose derangement graphs are complete multipartite. This paper gives two new families of transitive groups with complete multipartite derangement graphs. In addition, we prove that if p is an odd prime and G is a transitive group of degree 2p, then the independence number of GammaG is at most twice the size of a point-stabilizer of G.





Describes a project that uses

Uses Software





This page was built for publication: On complete multipartite derangement graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013345)