arXiv (All)
open access
Minimum blockers and extremal graphs for nonnested matchings
We classify all smallest sets of edge deletions that destroy every nonnested perfect matching in a complete ordered graph. The vertices have a fixed linear order. A perfect matching selects edges that use each vertex exactly once; it is nonnested when no selected edge has both endpoints strictly bet
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
- Tractability of Hard Digraph Cut Problems on Eulerian Instances: Treewidth Reduction and Reducing CMSO to Unbreakable Eulerian Instances#1341751
- The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern#818722
- The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern#808730
- Non-isomorphic graphs have distinct vertex-Ramsey classes#1188415
- Online matching games in bipartite expanders: Hall-type results and applications to non-blocking connectors#1083935
Record · ID 1247467
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