Most probably trangle-free graphs

The celebrated Mantel's theorem states that any triangle-free graph on $n$ vertices contains at most $\left\lfloor n^2/4\right\rfloor$ edges. It is natural to ask how many triangles must exist in a graph with more than $\left\lfloor n^2/4\right\rfloor$ edges--a problem known as the Erdős-Rademacher problem. In this paper, we propose a probabilistic variant of this classic problem. Specifically, given an $n$-vertex graph $G$ with $\left\lfloor n^2/4\right\rfloor+i$ ($i>0$) edges, we choose the edges of $G$ independently with probability $p$, and the resulting new graph is triangle-free with a certain probability. Our goal is to maximize this probability by choosing $G$ appropriately. For the case where $G$ has $ \left\lfloor n^2/4\right\rfloor +1$ edges, we determine the exact maximum probability.