Weak saturation numbers of K₂, t and K_p K_q

DOI10.1016/J.AKCEJ.2019.04.003MaRDI QIDQ2176148zbMATH OpenOpenAlexFDO

Authors Yajuan Cui, Liqun Pu

Publication date 4 May 2020

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.akcej.2019.04.003

zbMATH Keywords

complete graphcomplete bipartite graphweakly saturated graphweak saturation number

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• Weak saturation numbers of complete bipartite graphs in the clique
• Weak saturation numbers for graphs
• Weak saturation number for multiple copies of the complete graph with a star removed
• Weak saturation numbers for multiple copies
• Weak saturation numbers for sparse graphs

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• A survey of minimum saturated graphs
• Graph theory with applications
• Saturated r-uniform hypergraphs
• Saturated graphs with minimal number of edges
• Size of weakly saturated graphs
• Weak saturation number for multiple copies of the complete graph with a star removed
• Weak saturation numbers for multiple copies
• Weak saturation numbers for sparse graphs
• Weakly P-saturated graphs
• Weakly saturated hypergraphs and exterior algebra

Cited in

(10)

• The weak saturation number of \(K_{2,t}\)
• Weak saturation number for multiple copies of the complete graph with a star removed
• Weak saturation of multipartite hypergraphs
• Weak saturation numbers for sparse graphs
• Weak saturation numbers for multiple copies
• Weak saturation numbers of complete bipartite graphs in the clique
• Saturation numbers of joins of graphs
• Weak saturation numbers for graphs
• Weak saturation number of a complete bipartite graph
• Minimum clique-free subgraphs of Kneser graphs

This page was built for publication: Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)

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