Few H copies of F saturated graphs

Authors

Juergen Kritschgau, Iowa State University

Document Type

Presentation Abstract

Presentation Date

2-24-2020

Abstract

A graph is F-saturated if it is F-free but the addition of any edge creates a copy of F. In this talk we will discuss the quantity sat(n,H,F) which denotes the minimum number of copies of H that an F-saturated graph on n vertices may contain. This parameter is a natural saturation analogue of Alon and Shikhelman's generalized Turán problem, and letting H=K₂ recovers the well-studied saturation function. We will focus on the cases where the host graph is either K_s or C_k-saturated.

Additional Details

February 24, 2020 at 3:00 p.m. in Math 103
Refreshments at 4:00 p.m. in Math Lounge 109

Recommended Citation

Kritschgau, Juergen, "Few H copies of F saturated graphs" (2020). Colloquia of the Department of Mathematical Sciences. 593.
https://scholarworks.umt.edu/mathcolloquia/593