• DOI:10.37236/41
Corpus ID: 1571354

A Survey of Minimum Saturated Graphs

@article{Faudree2011ASO,
  title={A Survey of Minimum Saturated Graphs},
  author={J. Faudree and R. Faudree and J. R. Schmitt},
  journal={Electronic Journal of Combinatorics},
  year={2011},
  volume={1000}
}

• J. Faudree, R. Faudree, J. R. Schmitt
• Published 2011
• Mathematics
• Electronic Journal of Combinatorics

View via Publisher

community.middlebury.edu

Save to Library

Create Alert

Cite

Launch Research Feed

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.