摘要
Given a family of (hyper)graphs F a (hyper)graph G is said to be F-saturated if G is F-free for any F is an element of F. but for any edge e in the complement of G the (hyper)graph G vertical bar e contains some F is an element of Y. We survey the problem of determining the minimum size of an F-saturated (hyper)graph and collect many open problems and conjectures.
- 出版日期2011-7-29