arXiv (All)
open access
A characterization of graphs attaining a lower bound on the dissociation number
The dissociation number ${\rm diss}(G)$ of a graph $G$ is defined as the maximum cardinality of a vertex subset $D\subseteq V(G)$ such that the induced subgraph $G[D]$ has maximum degree at most $1$. In 2023, Bock, Pardey, Penso and Rautenbach [J. Graph Theory 103 (2023), 661--673] showed that ${\rm
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
- A reciprocal graph-deviation functional: structural identifiability from controlled equilibrium maps#1422938
- Extremes of the zero-average Gaussian Free Field on random regular graphs#1201944
- Conviction versus Conformity in a Random-Field Ising Electorate: Antagonistic Ties, Network Density, and a Parameter-Free Prediction#1447388
- Foundations of Diatonic Theory#1179371
- No noise, no party! On Shannon, Aesthetics and one reason for the love of random in digital art practices#204310
Record · ID 1458878
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