arXiv (OAI Expanded)
open access
Independent Sets and Balanced Cycle-Linkings in 2-Connected Graphs
For every $α\ge3$ and all sufficiently large $n$, we identify a single graph that simultaneously maximizes the number of independent sets of every size among all $n$-vertex $2$-connected graphs with independence number $α$. This graph is unique up to isomorphism and is a balanced cycle-linking of th
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
- Parameterized Enumeration of Minimal Defensive Alliances#1064528
- Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable#1064381
- Increasing coding opportunities using maximum-weight clique#71617
- On the distinct maximal-clique sizes in $k$-uniform hypergraphs#998314
- The Cartan-Topos Protocol: A Unified Geometric and Categorical Framework for Resilient Multi-Agent Coordination#246530
Record · ID 1109619
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