An Induced Subgraph Paradigm for Strongly Regular Graph Constructions
Benjamin Baker
Abstract
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) strongly regular graph with parameters (99,14,1,2). 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.
Create a lesson
Related papers
Uniform Intersection Numbers and Subgroup-Based Generating Graphs of Groups
Projesh Nath Choudhury, Biswaranjan Khanra
Logical isomorphism and logical limit laws for small permutation classes and regular languages
Klas Marström, Eero Räty
Wild number for spanning trees in complete and complete bipartite graphs
Aleyah Dawkins, Alexander Nappo, Jessie Tong et al.
Unavoidable flats in GF(q)-representable matroids
Jim Geelen, Matthew E. Kroeker, Peter Nelson
Barrier Log-Concavity of Large Forests
Vadim E. Levit
Integral homology lattices of matching and circulant complexes
Qihang Wang, Weiye Li