“School of Mathematics”
Back to Papers HomeBack to Papers of School of Mathematics
| Paper IPM / M / 14947 |
|
||||
| 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 \mathbbmslG(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 \mathbbmslG(n, p) when F is a star graph.
Download TeX format |
|||||
| back to top | |||||
