Weak saturation number for multiple copies of the complete graph with a star removed

DOI10.1016/j.dam.2015.10.028zbMath1333.05152OpenAlexW2199379151MaRDI QIDQ266847

Liqun Pu, Yajuan Cui

Publication date: 7 April 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.10.028

zbMATH Keywords

multiple copiessaturated graphsweak saturation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) ⋮ Weak saturation number of a complete bipartite graph

Cites Work

• Unnamed Item
• A survey of minimum saturated graphs
• Weak saturation numbers for multiple copies
• Size of weakly saturated graphs
• Saturated \(r\)-uniform hypergraphs
• Weakly Saturated Hypergraphs and Exterior Algebra
• Saturated graphs with minimal number of edges
• Weakly P-saturated graphs
• Weak saturation numbers for sparse graphs

This page was built for publication: Weak saturation number for multiple copies of the complete graph with a star removed