arXiv (All)
open access
Spreads of degrees in graphs
For a graph $G$ and a set $B\subseteq V(G)$, the spread $\mathrm{sp}(B)$ of $B$ is the difference between the largest and the smallest degree in $G$ of a vertex of $B$, and for an integer $k\geq0$ the parameter $\mathrm{sp}(G,k)$ is the largest cardinality of a set $B$ with $\mathrm{sp}(B)\leq k$. C
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
- Large induced subgraphs with $k$ vertices of maximum degree#822116
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
- An Exact Dominant Degree Condition for Transitive Tournament Factors in Digraphs#986319
- Maximizing the number of cliques in $K_{r+1}$-free graphs with forbidden properties#1051689
- Maker-Breaker Largest Connected Subgraph Game in Trees#1090704
Record · ID 1014348
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