Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Demyanov, Sergej"'
Autor:
Demyanov, Sergej, Zhukovskii, Maksim
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 $\mathrm{sat}(G, F)$. For the star $F=K_{1,r}$, the asymptotics of $\mathrm{sat}(G(n,p),F)$ is
Externí odkaz:
http://arxiv.org/abs/2212.06101
