Saturation numbers for \(t P_k\) with \(k\) less than 6

DOI10.1016/j.dam.2022.10.001zbMath1504.05156OpenAlexW4308544326MaRDI QIDQ2104931

Xiaopan Lian, Hui Lei, Junxue Zhang, Shunyu Yao, Shu-Juan Cao

Publication date: 8 December 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.10.001

zbMATH Keywords

extremal graphsaturation numberlinear forest

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Related Items (3)

Weak saturation number of a complete bipartite graph ⋮ Some results on the saturation number for unions of cliques ⋮ Minimum \(t P_3\)-saturation graphs

Cites Work

• Unnamed Item
• A survey of minimum saturated graphs
• Turán numbers for disjoint copies of graphs
• The Turán number of disjoint copies of paths
• Turán Numbers of Multiple Paths and Equibipartite Forests
• Saturated graphs with minimal number of edges
• A Problem in Graph Theory

This page was built for publication: Saturation numbers for \(t P_k\) with \(k\) less than 6