| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903084 | Discrete Mathematics | 2018 | 5 Pages |
Abstract
For a given graph F, the F-saturation number of a graph G is the minimum number of edges in an edge-maximal F-free subgraph of G. Recently, the F-saturation number of the ErdÅs-Rényi random graph G(n,p) has been determined asymptotically for any complete graph F. In this paper, we give an asymptotic formula for the F-saturation number of G(n,p) when F is a star graph.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
A. Mohammadian, B. Tayfeh-Rezaie,