Weak saturation number of a complete bipartite graph

DOI10.1016/j.amc.2023.128097MaRDI QIDQ6107985

Baoyindureng Wu, Unnamed Author

Publication date: 29 June 2023

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

zbMATH Keywords

cliquecomplete bipartite graphsweak saturation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak saturation number for multiple copies of the complete graph with a star removed
• A survey of minimum saturated graphs
• Size of weakly saturated graphs
• Saturation numbers for linear forests \(P_5\cup tP_2\)
• An extremal problem for sets with applications to graph theory
• Hyperconnectivity of graphs
• An extremal problem for two families of sets
• Asymptotic growth of sparse saturated structures is locally determined
• Extremal problems on saturation for the family of $k$-edge-connected graphs
• Saturation numbers for \(t P_k\) with \(k\) less than 6
• Weak saturation numbers of complete bipartite graphs in the clique
• On the number of edges in a minimum \(C_6\)-saturated graph
• A note on the saturation number of the family of \(k\)-connected graphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• The partite saturation number of spider
• Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
• A Problem in Graph Theory
• Weak saturation numbers for sparse graphs
• On generalized graphs

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