arXiv (All)
open access
Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates
We study the maximum strong independent set problem in a finite hypergraph: find the largest vertex set that intersects every hyperedge in at most one vertex. This objective arises whenever each observed block is a local incompatibility constraint but transitive closure across overlapping blocks is
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 Hypergraph Supports#1013362
- Streaming Hypergraph Coloring via Palette Sparsification#1013660
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Locating-dominating partitions for some classes of graphs#147107
- Spanning subhypergraphs with degree constraints#1109177
Record · ID 1011663
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