arXiv (All)
open access
Extension properties for partial permutations
Motivated by the EPPA problem for finite tournaments,we consider various extension properties for partial permutations. We show that for any set $Π$ of prime numbers, the $Π$-extension property is equivalent to the $Π$-LERF. As a consequence of known results, the odd-extension property is then equiv
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
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- A Huppert-type $ρ^*$--$σ^*$ theorem for sub-class sizes#1077589
- Combinatorial bounds for the v-number of binomial edge ideals#1343729
- Degeneracy bounds, stability, and a sharp gap for $B$-colorings#924967
Record · ID 1200521
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