arXiv (All)
open access
On the Minimum Possible Maximum Degree of Induced Subgraphs of Product Graphs
The following is a natural and fundamental question for a graph $G$: if an induced subgraph $H$ of $G$ has $x$ more vertices than a maximum independent set, what can be said about the maximum degree of $H$ as a function of $x$? The case $x=1$ is already of considerable interest. For example, in hi
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
- Forbidden Subgraphs of Graphs with Low Bandwidth#822364
- Large induced subgraphs with $k$ vertices of maximum degree#822116
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm#971967
- Bipartite Turán Numbers of Trees and Star Forests#1118674
Record · ID 1117615
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