Weak saturation numbers for sparse graphs

DOI10.7151/dmgt.1688zbMath1295.05130OpenAlexW2007397632MaRDI QIDQ5495050

Michael S. Jacobson, Ralph J. Faudree, Ronald J. Gould

Publication date: 30 July 2014

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

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

zbMATH Keywords

sparse graphssaturated graphsweak saturation

Mathematics Subject Classification ID

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

Related Items (7)

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 number of a complete bipartite graph ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Weak saturation numbers of complete bipartite graphs in the clique ⋮ Weak saturation numbers for multiple copies

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