arXiv (All)
open access
Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census
Every balanced instance of the stable marriage problem with strict complete preferences has a unique finest partition into prime blocks, and that single partition simultaneously factors three different structures: the reachable execution digraph as a Cartesian product, the proposal-prefix antimatroi
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
- One-to-One Matching with Interdependent Preferences#1274734
- Hamilton paths and cycles in flip graphs of (almost-)perfect matchings#1297192
- Combinatorial games and the golden ratio on digraphs#617862
- Combinatorial games and the golden ratio on digraphs#617362
- Three-sided matchings and separable preferences#1278282
Record · ID 1201630
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