Find a simple combinatorial proof, without generating functions or induction, that for rooted plane trees T_n with decreasing child labels, the probability p_n that a…
Statement
Find a simple combinatorial proof, without generating functions or induction, that for rooted plane trees T_n with decreasing child labels, the probability p_n that a uniformly random vertex of a uniformly random tree is a leaf converges to 2/3 as n tends to infinity.
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.