Erdős Problem #1155 — The final size of random triangle removal
Statement
Starting with , repeatedly choose a triangle uniformly at random and delete its three edges until the graph is triangle-free. If is the number of remaining edges, is with high probability, and in particular is ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.