arXiv (All)
open access
Induced Embeddings of Graphs into Abelian Cayley Graphs
For a finite graph $G$ on $n$ vertices, let $η(G)$ denote the least order of a finite abelian group $Γ$ for which $G$ is an induced subgraph of some Cayley graph of $Γ$. Babai and Sós (1985) settled the worst-case order of magnitude: it is $Θ(n^2)$. We treat $η$ instead as an invariant of the indivi
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
- Element Orders and Character Codegrees of Finite Groups#974956
- The permutation dimension of the Klein 4-group#1105914
- The Conway knot has infinite order in smooth concordance#1037061
- Flip Combinatorial Invariance and Weyl groups#1014545
- Orthogonal Quantum Latin Squares with Maximal Cardinality from Full-Rank Factorizations#1076999
Record · ID 926237
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