Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let G be a graph and δ(G) the minimum degree of a peak. Describe an algorithm in pseudocode that, for a given tree T with k<= δ(G) edges, should be build (in polinomial time) a sub-graph H of G so that H is isomorphic with T.

How do I even start ?

share|cite|improve this question
up vote 1 down vote accepted

Scan the tree $T$ in some arbitrary way, meanwhile tracing out the subgraph $H$ (start at an arbitrary vertex of $G$). Take care not to close cycles. The condition on the minimum degree ensures that you'll never "run out of edges".

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.