Caterpillars and alternating paths

09/12/2021
by   Rain Jiang, et al.
0

Let p(m) (respectively, q(m)) be the maximum number k such that any tree with m edges can be transformed by contracting edges (respectively, by removing vertices) into a caterpillar with k edges. We derive closed-form expressions for p(m) and q(m) for all m ≥ 1. The two functions p(n) and q(n) can also be interpreted in terms of alternating paths among n disjoint line segments in the plane, whose 2n endpoints are in convex position.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro