- Tytuł:
- Gaps in the Saturation Spectrum of Trees
- Autorzy:
-
Horn, Paul
Gould, Ronald J.
Jacobson, Michael S.
Thomas, Brent J. - Powiązania:
- https://bibliotekanauki.pl/articles/31343596.pdf
- Data publikacji:
- 2019-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
saturation spectrum
tree
saturation number - Opis:
- 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). The saturation spectrum for a graph H is the set of sizes of H-saturated graphs between sat(n,H) and ex(n,H). In this paper we show that paths, trees with a vertex adjacent to many leaves, and brooms have a gap in the saturation spectrum.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 157-170
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł