arXiv (All)
open access
An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
Let $k\ge2$ be fixed. We study the integer lower bound $\ell(G)$ obtained by inverting the classical counting inequality for Turán systems. For a $k$-uniform hypergraph with $n$ vertices and $m$ edges, the bound can be evaluated exactly by binary search in time polynomial in the binary lengths of $n
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
- Turán problems with bounded matching number in $k$-uniform hypergraphs#1050532
- The strong (non-induced) Turán numbers#1077233
- A polynomial time algorithm for almost bounded denumerant#612421
- A polynomial time algorithm for almost bounded denumerant#610944
- Faster Minimum k-Cut I: Simple and Sparse Weighted Graphs#1064325
Record · ID 1011997
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