A survey of minimum saturated graphs
The Electronic Journal of Combinatorics, 2011•emis.de
Given a family of (hyper) graphs $\mathcal {F} $ a (hyper) graph $ G $ is said to be $\mathcal
{F} $-saturated if $ G $ is $ F $-free for any $ F\in\mathcal {F} $ but for any edge e in the
complement of $ G $ the (hyper) graph $ G+ e $ contains some $ F\in\mathcal {F} $. We
survey the problem of determining the minimum size of an $\mathcal {F} $-saturated (hyper)
graph and collect many open problems and conjectures.
{F} $-saturated if $ G $ is $ F $-free for any $ F\in\mathcal {F} $ but for any edge e in the
complement of $ G $ the (hyper) graph $ G+ e $ contains some $ F\in\mathcal {F} $. We
survey the problem of determining the minimum size of an $\mathcal {F} $-saturated (hyper)
graph and collect many open problems and conjectures.
Abstract
Given a family of (hyper) graphs a (hyper) graph is said to be -saturated if is -free for any but for any edge e in the complement of the (hyper) graph contains some . We survey the problem of determining the minimum size of an -saturated (hyper) graph and collect many open problems and conjectures.
emis.de
以上显示的是最相近的搜索结果。 查看全部搜索结果