arXiv (All)
open access
Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition
The small blocking set detection and construction problem asks whether a given connected simple graph contains a nonempty independent set whose cardinality equals the size of its neighborhood and is strictly less than half the number of vertices, and, if so, how to construct such a set. Previous wor
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
- Network Discovery and Selection Problem#420315
- On the (In)Approximability of the Monitoring Edge Geodetic Set Problem#1328304
- ALMOST PERFECT MATRICES AND GRAPHS#941673
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- On $k$-limited domination: complexity and Cartesian products#1156397
Record · ID 1297448
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