A survey of minimum saturated graphs (Q554011)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5933979
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A survey of minimum saturated graphs |
scientific article; zbMATH DE number 5933979 |
Statements
A survey of minimum saturated graphs (English)
0 references
29 July 2011
0 references
Summary: 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.
0 references
0.8697407245635986
0 references
0.8310059905052185
0 references
0.8309166431427002
0 references
