Weak saturation numbers of K₂, t and K_p K_q
From MaRDI portal
Publication:2176148
DOI10.1016/J.AKCEJ.2019.04.003zbMATH Open1439.05214OpenAlexW2945143170MaRDI QIDQ2176148FDOQ2176148
Authors: Yajuan Cui, Liqun Pu 
Publication date: 4 May 2020
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2019.04.003
Recommendations
Cites Work
- Saturated \(r\)-uniform hypergraphs
- Weak saturation number for multiple copies of the complete graph with a star removed
- Weakly saturated hypergraphs and exterior algebra
- Graph theory with applications
- Saturated graphs with minimal number of edges
- Title not available (Why is that?)
- Weakly P-saturated graphs
- Weak saturation numbers for sparse graphs
- A survey of minimum saturated graphs
- Weak saturation numbers for multiple copies
- Size of weakly saturated graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
