Sub-trees of a random tree

From MaRDI portal
Publication:2274085



Abstract: Let T be a random tree taken uniformly at random from the family of labelled trees on n vertices. In this note, we provide bounds for c(n), the number of sub-trees of T that hold asymptotically almost surely. With computer support we show that 1.41805386nlec(n)le1.41959881n. Moreover, there is a strong indication that, in fact, c(n)le1.41806183n.






Describes a project that uses

Uses Software






This page was built for publication: Sub-trees of a random tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274085)