An Induced Subgraph Paradigm for Strongly Regular Graph Constructions
Benjamin Baker
Source abstract
How many disjoint copies of some graph 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) strongly regular graph with parameters . The equality cases suggest alternative structural approaches for potential constructions of such a graph. We show, using computer searches, that one cannot impose certain additional natural conditions for some of the cases.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.