Document Type
Lecture
Publication Date
10-22-2025
Abstract
A class of graphs closed under taking induced subgraphs is called hereditary. We show that the class of graphs within a fixed number of vertex deletions, edge deletions, and edge additions from a hereditary class also has finitely many forbidden induced subgraphs provided that the original class does. We discuss some consequences of this result and present a corresponding analogue for matroids.
Relational Format
presentation
Recommended Citation
Singh, Jadeep, "Hereditary classes of graphs and matroids with finitely many exclusions" (2025). Combinatorics Seminar. 125.
https://egrove.olemiss.edu/math_combinatorics/125
Accessibility Status
Searchable text
COinS