Kalinichenko, O. and Zhukovskii, M. orcid.org/0000-0001-8763-9533 (2023) Weak saturation stability. European Journal of Combinatorics, 114. 103777. ISSN: 0195-6698
Abstract
The paper studies wsat(G,H) which is the minimum number of edges in a weakly H-saturated subgraph of G. We prove that wsat(Kn,H) is ‘stable’– remains the same after independent removal of every edge of Kn with constant probability– for all pattern graphs H such that there exists a ‘local’ set of edges percolating in Kn. This is true, for example, for cliques and complete bipartite graphs. We also find a threshold probability for the weak K1,t-saturation stability
Metadata
| Item Type: | Article |
|---|---|
| Authors/Creators: |
|
| Copyright, Publisher and Additional Information: | © 2023 The Authors. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). |
| Keywords: | Applied Mathematics; Pure Mathematics; Mathematical Sciences |
| Dates: |
|
| Institution: | The University of Sheffield |
| Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
| Date Deposited: | 06 Oct 2025 15:54 |
| Last Modified: | 06 Oct 2025 15:54 |
| Status: | Published |
| Publisher: | Elsevier BV |
| Refereed: | Yes |
| Identification Number: | 10.1016/j.ejc.2023.103777 |
| Related URLs: | |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:232616 |

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)