Size of weakly saturated graphs

DOI10.1016/J.DISC.2005.11.085MaRDI QIDQ878645zbMATH OpenOpenAlexFDO

Authors Elżbieta Sidorowicz

Publication date 26 April 2007

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hereditary propertiessaturated graphsweakly saturated graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Review text

The author investigates some properties of weakly saturated graphs, and gives some estimations for the minimum size of weakly \(P\)-saturated graphs.

Cites work

• scientific article; zbMATH DE number 3920492 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• On some variations of extremal graph problems
• On the theory of graphs
• Weakly P-saturated graphs

Cited in

(8)

• Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
• Weak saturation numbers of complete bipartite graphs in the clique
• Weak saturation number for multiple copies of the complete graph with a star removed
• On the effective size of a non-Weyl graph
• scientific article; zbMATH DE number 915258 (Why is no real title available?)
• Weakly saturated hypergraphs and a conjecture of Tuza
• Weak saturation number of a complete bipartite graph
• Weak saturation numbers for multiple copies

This page was built for publication: Size of weakly saturated graphs

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