Weakly Saturated Subgraphs of Random Graphs

1. N. Alon, “An extremal problem for sets with applications to graph theory,” J. Combin. Theory Ser. A 40 (1), 82–89 (1985).

   Article  MathSciNet  MATH  Google Scholar 

2. M. R. Bidgoli, A. Mohammadian, B. Tayfeh-Rezaie, and M. Zhukovskii, “Threshold for weak saturation stability,” arXiv:2006.06855 (2020).

3. B. Bollobás, “Weakly k-saturated graphs,” in Beiträge zur Graphentheorie (Teubner, Leipzig, 1968), pp. 25–31.

4. G. Kalai, “Hyperconnectivity of graphs,” Graphs Combin. 1, 65–79 (1985).

   Article  MathSciNet  MATH  Google Scholar 

5. O. Kalinichenko and M. Zhukovskii, “Weak saturation stability,” arXiv:2107.11138 (2022).

6. D. Korándi and B. Sudakov, “Saturation in random graphs,” Random Struct. Algorithms 51 (1), 169–181 (2017).

   Article  MathSciNet  MATH  Google Scholar 

7. M. Krivelevich and B. Patkós, “Equitable coloring of random graphs,” Random Struct. Algorithms 35 (1), 83–99 (2009).

   Article  MathSciNet  MATH  Google Scholar 

8. G. Kronenberg, T. Martins, and N. Morrison, “Weak saturation numbers of complete bipartite graphs in the clique,” J. Combin. Theory Ser. A 178, 105357 (2021).

9. L. Lovász, “Flats in matroids and geometric graphs,” in Combinatorial Surveys (Academic, New York, 1977), pp. 45–86.

   Google Scholar 

10. J. Spencer, “Threshold functions for extension statements,” J. Combin. Theory Ser. A 53, 286–305 (1990).

    Article  MathSciNet  MATH  Google Scholar 

Download references