Induced paths in strongly regular graphs
Abstract
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path P4 as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite graph nor its complement. Also, we investigate when a strongly regular graph has an induced subgraph isomorphic to P5 or its complement, considering several well-known families including Johnson and Kneser graphs, Hamming graphs, Latin square graphs, and block-intersection graphs of Steiner triple systems.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.