Gaps in the Saturation Spectrum of Trees

Abstract 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.

[1]  Béla Bollobás,et al.  Extremal problems in graph theory , 1977, J. Graph Theory.

[2]  JAN HLADKÝ,et al.  The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs , 2017, SIAM J. Discret. Math..

[3]  L. Moser,et al.  AN EXTREMAL PROBLEM IN GRAPH THEORY , 2001 .

[4]  Jan Hladký,et al.  The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result , 2017, SIAM J. Discret. Math..

[5]  P. Erdos,et al.  A LIMIT THEOREM IN GRAPH THEORY , 1966 .

[6]  P. Erdös.  On an extremal problem in graph theory , 1970 .

[7]  Frank Harary,et al.  Size in maximal triangle-free graphs and minimal graphs of diameter 2 , 1995, Discret. Math..

[8]  Christopher M. Hartman.  Extremal problems in graph theory , 1997 .

[9]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[10]  Andrew McLennan,et al.  The Erdős‐Sós Conjecture for trees of diameter four , 2005, Journal of Graph Theory.

[11]  Jan Hladký,et al.  The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition , 2012, SIAM J. Discret. Math..

[12]  Elzbieta Sidorowicz,et al.  On the Non-(p−1)-Partite Kp-Free Graphs , 2013, Discuss. Math. Graph Theory.

[13]  The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs , 2017, SIAM J. Discret. Math..

[14]  Cun-Quan Zhang,et al.  The edge spectrum of the saturation number for small paths , 2012, Discret. Math..

[15]  P. Erdgs,et al.  ON MAXIMAL PATHS AND CIRCUITS OF GRAPHS , 2002 .

[16]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[17]  A. F. Sidorenko,et al.  Asymptotic solution for a new class of forbiddenr-graphs , 1989, Comb..