Forbidden subgraphs on conjugacy class graphs of groups
Papi Ray, Sonakshee Arora

TL;DR
This paper studies the structure of conjugacy class graphs in finite groups, classifying forbidden subgraphs for various graph types across different classes of groups, and characterizing these graphs for specific well-known groups.
Contribution
It provides a comprehensive classification of forbidden induced subgraphs in conjugacy class graphs for multiple group classes, including symmetric, alternating, and simple groups.
Findings
Complete classifications for EPPO, order pq, and nilpotent groups.
Characterizations for symmetric, alternating, and certain solvable groups.
Solvable conjugacy class graphs are always cographs for specific groups.
Abstract
Let be a finite group. The \textit{commuting/nilpotent/solvable conjugacy class graph} (, , or ) is a simple graph whose vertex set consists of all non-central conjugacy classes of . Two vertices and are adjacent if and only if there exist elements and such that forms an abelian, nilpotent, or solvable subgroup of , respectively.\par In this paper, we mainly investigate cographs (it is -free), chordal graphs (it is -free ), split graphs (it contains no induced subgraph isomorphic to , and ), threshold graphs (it contains no induced subgraph isomorphic to , , and ), and claw-free graphs (it contains no vertex with three pairwise non-adjacent neighbours) in terms of forbidden induced subgraphs in…
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 · Coding theory and cryptography
