Graph saturation in multipartite graphs
From MaRDI portal
Publication:5963384
Abstract: Let be a fixed graph and let be a family of graphs. A subgraph of is -saturated if no member of is a subgraph of , but for any edge in , some element of is a subgraph of . We let and denote the maximum and minimum size of an -saturated subgraph of , respectively. If no element of is a subgraph of , then . In this paper, for and we determine , where is the complete balanced -partite graph with partite sets of size . We also give several families of constructions of -saturated subgraphs of for . Our results and constructions provide an informative contrast to recent results on the edge-density version of from [A. Bondy, J. Shen, S. Thomass'e, and C. Thomassen, Density conditions for triangles in multipartite graphs, Combinatorica 26 (2006), 121--131] and [F. Pfender, Complete subgraphs in multipartite graphs, Combinatorica 32 (2012), no. 4, 483--495].
Recommendations
Cited in
(17)- Rainbow Saturation for Complete Graphs
- Saturated boundary \(k\)-alliances in graphs
- A note on minimum \(K_{2,3}\)-saturated graphs
- Saturation in Fuzzy Graphs
- Linearity of saturation for Berge hypergraphs
- Minimum degree and the minimum size of \(K_2^t\)-saturated graphs
- Partite saturation problems
- Saturation numbers in tripartite graphs
- On \((\mathrm{K}_t-e)\)-saturated graphs
- Partite saturation of complete graphs
- Min-max and max-min graph saturation parameters
- The partite saturation number of spider
- Saturation in random graphs
- Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph
- Saturation in Kneser graphs
- scientific article; zbMATH DE number 3939391 (Why is no real title available?)
- The saturation function of complete partite graphs
This page was built for publication: Graph saturation in multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963384)