Weak saturation numbers for multiple copies

DOI10.1016/j.disc.2014.07.012zbMath1297.05119OpenAlexW2025223814MaRDI QIDQ740652

Ralph J. Faudree, Ronald J. Gould

Publication date: 4 September 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.012

zbMATH Keywords

multiple copiesweak saturation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (6)

Weak saturation number for multiple copies of the complete graph with a star removed ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\) ⋮ Weak saturation stability ⋮ Cycle Saturation in Random Graphs ⋮ Weak saturation numbers of complete bipartite graphs in the clique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of minimum saturated graphs
• 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 numbers for multiple copies