MATH Seminar
| Title: On $K_t$-saturated Graphs |
|---|
| Seminar: Combinatorics |
| Speaker: Kinnari Amin of Emory University |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2009-12-04 at 4:00PM |
| Venue: W306 |
| Download Flyer |
| Abstract: Let $H$ be a graph. An $H$-free graph $G$ is called $H$-saturated if the addition of any new edge to $G$ results in a subgraph isomorphic to $H$. The minimum size of an $H$-saturated graph on n vertices is denoted by sat($n$, $H$). The edge spectrum for the family of graphs with property $P$ is the set of all sizes of graphs with property $P$. In this talk, I will present new results about the edge spectrum of $ K_t$-saturated graphs. This is joint work with Jill Faudree and Ronald Gould. |
See All Seminars