arXiv (All)
open access
On the Hamiltonicity of generating graphs of almost simple groups
The generating graph $Γ(G)$ of a finite group $G$ has vertex set $G\setminus\{1\}$, and two distinct vertices are adjacent if and only if they generate $G$. Breuer, Guralnick, Lucchini, Maroti and Nagy [Bull. Lond. Math. Soc. 42 (2010), 621--633] conjectured that, for every finite group $G$ with at
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
- Spread Methods for Induced Cycles#1056373
- Fort Abundance in Zero Forcing#999442
- Reinforcement Learning for Graph Generation under a Hard Assortativity Constraint#1014716
- The forbidden structure for zero forcing number#784747
- The forbidden structure for zero forcing number#783157
Record · ID 987144
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