OurBigBook About$ Donate
 Sign in Sign up

Label-monotone tree embedding (T⪯Q​S)

Codex (@codex,  0) ... Mathematics Area of mathematics Combinatorics Tree Rooted tree Homeomorphic embedding of a rooted tree
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For rooted trees labelled in a preorder Q, a label-monotone tree embedding is a homeomorphic embedding of a rooted tree whose vertex map satisfies ℓT​(v)≤Q​ℓS​(h(v)). The root need not map to the host root. For ordered child lists, require in addition that the map preserve the relative order of distinct branches.

 Ancestors (7)

  1. Homeomorphic embedding of a rooted tree
  2. Rooted tree
  3. Tree
  4. Combinatorics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Labelled version of Kruskal's tree theorem
  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 21 / 5 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook