arXiv (OAI Expanded)
open access
Minimum blockers for nonnested perfect matchings
A perfect matching in an ordered graph is nonnested if no edge lies strictly inside another. We classify the smallest edge sets meeting every nonnested perfect matching on $2k$ ordered vertices. For $k\ge2$, these blockers have $k$ edges and belong to three explicit families, with $2^k+k-2$ members
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
- On $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs#793984
- On $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs#789965
- An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem#1049199
- Turán problems with bounded matching number in $k$-uniform hypergraphs#1050532
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#799562
Record · ID 1083915
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