On multipartite derangement graphs
Andriaherimanana Sarobidy Razafimahatratra

TL;DR
This paper explores the structure of derangement graphs of transitive permutation groups, introducing new families with complete multipartite graphs and analyzing independence numbers for groups of degree 2p.
Contribution
It presents two new families of transitive groups with complete multipartite derangement graphs and bounds the independence number for groups of degree 2p.
Findings
Identified new families of transitive groups with complete multipartite derangement graphs.
Proved an upper bound on the independence number for groups of degree 2p.
Extended understanding of the structure of derangement graphs in permutation groups.
Abstract
Given a finite transitive permutation group , with , the derangement graph of is the Cayley graph , where is the set of all derangements of . Meagher et al. [On triangles in derangement graphs, {\it J. Combin. Theory Ser. A}, 180:105390, 2021] recently proved that acting on 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 is an odd prime and is a transitive group of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Chronic Lymphocytic Leukemia Research
