Tight concentration of star saturation number in random graphs
Work
Year: 2023
Type: article
Abstract: For given graphs F and G, the minimum number of edges in an inclusion-maximal F-free subgraph of G is called the F-saturation number and denoted sat(G,F). For the star F=K1,r, the asymptotics of sat(G... more
Source: Discrete Mathematics
Authors Sergej Demyanov, Maksim Zhukovskii
Institutions Moscow Institute of Physics and Technology, Institute of Physics and Technology, University of Sheffield
Cites: 9
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: hybrid
APC paid (est): $3,000