arXiv (All)
open access
An Induced Subgraph Paradigm for Strongly Regular Graph Constructions
How many disjoint copies of some graph $H$ can appear in an induced subgraph of a strongly regular graph? We give upper and lower bounds that depend on the number of vertices in their boundary. This generalizes a result of Lou-Murin which bounds the independence number of a (hitherto still elusive)
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
- Bounded Independence Edge Subsampling in Graphs#347579
- Fundamentals of domination in graphs#1179875
- Graph Decompositions at the Expectation Threshold#1049974
- Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders#1186590
- Nordhaus--Gaddum relations for degrees and connectivities under the $δ$-complement#1014455
Record · ID 1357954
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