arXiv (All)
open access
On Independence Number of Comaximal Subgroup Graph
In this paper, we establish sharp thresholds on the independence number of the comaximal subgroup graph $Γ(G)$ that guarantee solvability, supersolvability, and nilpotency of the underlying group $G$. Specifically: \begin{itemize} \item For solvability, we prove that any group $G$ with independenc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On residual finiteness of graphs of free groups with cyclic edge groups#7899
- Prime Graphs of Infinite Groups#1157450
- Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups#793586
- Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups#789582
- Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers#1118536
Record · ID 987438
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive