Weak saturation numbers for sparse graphs

DOI10.7151/DMGT.1688MaRDI QIDQ5495050zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, Ronald Gould, Michael Jacobson

Publication date 30 July 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1688

zbMATH Keywords

saturated graphssparse graphsweak saturation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Recommendations

• Weak saturation numbers for graphs
• Weak saturation numbers for multiple copies
• Saturation numbers for trees
• Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
• Weak saturation numbers of complete bipartite graphs in the clique

Cited in

(17)

• Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
• Weak saturation numbers of complete bipartite graphs in the clique
• Saturation numbers for trees
• Weak saturation number for multiple copies of the complete graph with a star removed
• Weakly P-saturated graphs
• Weak saturation numbers for graphs
• Weakly saturated hypergraphs and a conjecture of Tuza
• Weak saturation number of a complete bipartite graph
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• The weak saturation number of \(K_{2,t}\)
• Saturation numbers of joins of graphs
• Weak saturation numbers in random graphs
• Weak saturation numbers for the union of disjoint graphs
• Weak rainbow saturation numbers of graphs
• Weak saturation in graphs: a combinatorial approach
• A note on weak saturation number of trees
• Weak saturation numbers for multiple copies

This page was built for publication: Weak saturation numbers for sparse graphs

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