arXiv (All)
open access
The group generated by a graph's derangements
We introduce the leap group of a graph, the subgroup of the symmetric group on the vertex set generated by graph derangements. We summarize historical results on graph derangements, which we call hops, and prove additional existence and complexity results. The leap groups of various canonical graphs
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
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- Acyclic and oriented chromatic numbers of graphs#490219
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1109623
- Mixing Times of Switch Chains via High-Dimensional Expansion#1233545
- Generalized Sterboul--Deming Configurations#1000095
Record · ID 1343968
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