arXiv (All)
open access
Minimal transitive factorizations supported on quasi-threshold graphs
We study the number of minimal transitive factorizations of the identity permutation in $S_n$ into transpositions supported on a quasi-threshold graph. We show that this number is always divisible by $(2n-2)!/n!$, which is the factorization count for a star graph, as shown by Irving and Rattan. To p
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
- Generate to Accelerate: Improved Reranking via LLM-Generated Pivot Documents#677559
- Generate to Accelerate: Improved Reranking via LLM-Generated Pivot Documents#674360
- A condition for transitivity in high probability#763494
- A $2$-Approximation for Directed Feedback Vertex Set in Locally Semicomplete and Quasi-Transitive Digraphs#1013334
- Parameterized Enumeration of Minimal Defensive Alliances#1064528
Record · ID 1115938
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