How small can such a planted tree T can be while still leaving a detectable property in G(n, p) \cup T ?
Statement
How small can such a planted tree T can be while still leaving a detectable property in G(n, p) \cup T ? Theorem 1 (Possibility of detecting most known trees). Let p = c/n. There is a constant C such that the following holds. Let T be a uniform random labelled tree on k vertices. For most trees T , the following holds.
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.