arXiv (All)
open access
The Exact Degree Threshold for Complement Connectivity
For a graph $G$, we investigate sufficient degree conditions under which either $G$ or its complement $\overline{G}$ is $k$-connected. Motivated by a theorem of Hellwig and Volkmann, we introduce the notion of complement connectivity admissible pairs and define the parameter $\mathcal{C}(k)$ as the
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
- Correlated equilibria, incomplete information and coalitional deviations#186812
- TABLE 3. Baseline comparability of randomised groups#418172
- BATched Sparse (BATS) Coding Scheme for Multi-hop Data Transport#134766
- 21 U.S.C. § 391 — Separability clause#577185
- Chapter 1 Student voices on social exclusion in general primary schools#486886
Record · ID 1324893
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