| Issue |
RAIRO-Oper. Res.
Volume 60, Number 4, July-August 2026
|
|
|---|---|---|
| Page(s) | 2121 - 2129 | |
| DOI | https://doi.org/10.1051/ro/2026073 | |
| Published online | 16 July 2026 | |
Saturation numbers for linear forests P5 ∪ P4 ∪ tP2
1
Business School, Shanghai Dianji University, Shanghai 201306, P.R. China
2
Center for Combinatorics, Nankai University, Tianjin 300071, P.R. China
3
School of Mathematical Sciences, Xinjiang Normal University, Urumchi, Xinjiang 830017, P.R. China
* Corresponding author: This email address is being protected from spambots. You need JavaScript enabled to view it.
Received:
9
June
2025
Accepted:
7
June
2026
Abstract
We say that G is F-saturated if G contains no copy of F and for all e∈E(Ḡ) the graph G+e does contain a copy of F. The saturation number, denote by sat(n,F) is the minimum size of a graph with order n in all F-saturated graphs. In this paper, we determine the saturation numbers for linear forests P5∪P4∪tP2 and characterize the extremal graphs.
Mathematics Subject Classification: 05C35
Key words: Saturation number / saturated graph / linear forest
© The authors. Published by EDP Sciences, ROADEF, SMAI 2026
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.