Gaps in the Saturation Spectrum of Trees
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum size is the well studied extremal number, ex(n,H...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
University of Zielona Góra
2019-02-01
|
| Collection: | Discussiones Mathematicae Graph Theory |
| Sujets: | |
| Accès en ligne: | https://doi.org/10.7151/dmgt.2073 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|