arXiv (All)
open access
Exact Diameter Windows for Random Cayley Graphs on Odd-Order Abelian Groups
Let \(d\ge2\) be fixed and let \(G_n\) be finite abelian groups of odd orders \(N_n\to\infty\). We determine the centered diameter-\(d\) critical window for the standard random Cayley graph in which each nonzero group element is selected independently. Writing \(M_n=(N_n-1)/2\), we prove that the no
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
- Uniquely labelled geodesics of Coxeter groups#1142499
- Automorphism groups of Cayley graphs on almost simple groups with normal connection sets#1036071
- GGS-groups acting on trees of growing degrees#609742
- Hypergraph Universality and Erdos-Posa Failure for Chromatically Rich Odd Cycles#1062060
- Sharp Asymptotics for Abelian Covers of Groups with Bounded Noncommutativity#659074
Record · ID 1076229
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