论文信息 - Weak saturation numbers of K2, t and Kp⋃Kq

Weak saturation numbers of K2, t and Kp⋃Kq

A graph is weakly -saturated if contains no copy of , and there is an ordering of all edges of so that if they are added one at a time, they form a complete graph and each edge added creates a new ...

Liqun Pu | Yajuan Cui | Yajuan Cui | Liqun Pu

[1] Oleg Pikhurko,et al. Weakly Saturated Hypergraphs and Exterior Algebra , 2001, Combinatorics, Probability and Computing.

[2] Michael S. Jacobson,et al. Weak Saturation Numbers for Sparse Graphs , 2013, Discuss. Math. Graph Theory.

[3] Zsolt Tuza,et al. Saturated r-uniform hypergraphs , 1991, Discret. Math..

[4] Katarzyna Rybarczyk,et al. Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method , 2011, Electron. J. Comb..

[5] Ralph J. Faudree,et al. A Survey of Minimum Saturated Graphs , 2011 .

[6] Ralph J. Faudree,et al. Weak saturation numbers for multiple copies , 2014, Discret. Math..

[7] Liqun Pu,et al. Weak saturation number for multiple copies of the complete graph with a star removed , 2016, Discret. Appl. Math..

[8] Yan-Ping Mu. Andrews' Conjecture on a $_4\phi_3$ Summation and its Extensions , 2012 .

[9] Zsolt Tuza,et al. Saturated graphs with minimal number of edges , 1986, J. Graph Theory.

[10] Mieczyslaw Borowiecki,et al. Weakly P-saturated graphs , 2002, Discuss. Math. Graph Theory.

[11] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[12] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[13] Elzbieta Sidorowicz. Size of weakly saturated graphs , 2007, Discret. Math..