Weak saturation numbers for multiple copies

DOI10.1016/J.DISC.2014.07.012MaRDI QIDQ740652zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, Ronald 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)

Recommendations

• Weak saturation numbers for graphs
• Weak saturation numbers for sparse graphs
• Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
• Weak saturation number for multiple copies of the complete graph with a star removed
• Weak saturation numbers of complete bipartite graphs in the clique

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• A survey of minimum saturated graphs
• Saturated r-uniform hypergraphs
• Saturated graphs with minimal number of edges
• Size of weakly saturated graphs
• Weak saturation numbers for graphs
• Weak saturation numbers for sparse graphs
• Weakly P-saturated graphs
• Weakly saturated hypergraphs and exterior algebra

Cited in

(10)

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

This page was built for publication: Weak saturation numbers for multiple copies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740652)