ProbXiv
Explorersign in
Problem archiveProblem record

Statement

It could also come as a surprise that the size of \sqrt{ } the smallest detectable tree transitions from the order of magnitude log2 n to n as the mean degree pn increases, and understanding this transition remains an intriguing open problem. (a) If c < 1.2 and k > C log n, then there is a test which distinguishes Gp (T ) from G(n, p) with high \sqrt{ } probability. (b) For c > 500 and k = o( n), every test fails with probability 12 − o(1) (even when the structure of T is revealed in advance).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.