Weak saturation number of a complete bipartite graph

DOI10.1016/J.AMC.2023.128097MaRDI QIDQ6107985zbMATH OpenFDO

Authors Baoyindureng Wu

Publication date 29 June 2023

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2023.128097

zbMATH Keywords

cliquecomplete bipartite graphsweak saturation

Mathematics Subject Classification ID

Set theory (03Exx) Enumerative combinatorics (05Axx) Graph theory (05Cxx)

Recommendations

• Weak saturation numbers of complete bipartite graphs in the clique
• The weak saturation number of \(K_{2,t}\)
• Weak saturation numbers of \(K_{2, t}\) and \(K_p \bigcup K_q\)
• Weak saturation of multipartite hypergraphs
• Weak saturation numbers for graphs

Cites work

• A note on the saturation number of the family of \(k\)-connected graphs
• A Problem in Graph Theory
• A survey of minimum saturated graphs
• An extremal problem for sets with applications to graph theory
• An extremal problem for two families of sets
• Asymptotic growth of sparse saturated structures is locally determined
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Extremal problems on saturation for the family of k-edge-connected graphs
• scientific article; zbMATH DE number 3920492 (Why is no real title available?)
• scientific article; zbMATH DE number 4081590 (Why is no real title available?)
• scientific article; zbMATH DE number 3561367 (Why is no real title available?)
• scientific article; zbMATH DE number 2191994 (Why is no real title available?)
• scientific article; zbMATH DE number 3275275 (Why is no real title available?)
• Hyperconnectivity of graphs
• On generalized graphs
• On the number of edges in a minimum \(C_6\)-saturated graph
• Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
• Saturation numbers for \(t P_k\) with \(k\) less than 6
• Saturation numbers for linear forests P₅ tP₂
• Size of weakly saturated graphs
• The partite saturation number of spider
• 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

Cited in

(3)

• Weak saturation of multipartite hypergraphs
• The weak saturation number of \(K_{2,t}\)
• Weak saturation numbers for the union of disjoint graphs

This page was built for publication: Weak saturation number of a complete bipartite graph

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