arXiv (All)
open access
Uniform Intersection Numbers and Subgroup-Based Generating Graphs of Groups
The uniform intersection number of a finite group $G$, denoted by $ui(G)$, is the smallest positive integer $k$ such that the intersection of any $k$ distinct maximal subgroups of $G$ is equal to its Frattini subgroup. We determine the uniform intersection number of dicyclic, dihedral, and quasi-dih
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
- Small Sets of Generators for Handlebody Groups#1344637
- Exact Diameter Windows for Random Cayley Graphs on Odd-Order Abelian Groups#1076229
- Finite groups with large power-avoiding subsets#1012694
- On Intersection Hypergraph of Finite Non-Cyclic Abelian Groups#1341823
- Fair hop Roman dominating function in graphs#76372
Record · ID 1357923
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