Multitree
In combinatorics and order-theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph (DAG) in which the set of vertices reachable from any vertex induces a tree, or a partially ordered set (poset) that does not have four items a, b, c, and d forming a diamond suborder with a ≤ b ≤ d and a ≤ c ≤ d but with b and c incomparable to each other (also called a diamond-free poset).
Wikipage redirect
primaryTopic
Multitree
In combinatorics and order-theoretic mathematics, a multitree may describe either of two equivalent structures: a directed acyclic graph (DAG) in which the set of vertices reachable from any vertex induces a tree, or a partially ordered set (poset) that does not have four items a, b, c, and d forming a diamond suborder with a ≤ b ≤ d and a ≤ c ≤ d but with b and c incomparable to each other (also called a diamond-free poset).
has abstract
En combinatoire et en théorie ...... u ordre partiel sans diamant).
@fr
In combinatorics and order-the ...... es, then it forms a multitree.
@en
Wikipage page ID
27,131,455
page length (characters) of wiki page
Wikipage revision ID
1,004,425,806
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
type
comment
En combinatoire et en théorie ...... u ordre partiel sans diamant).
@fr
In combinatorics and order-the ...... called a diamond-free poset).
@en
label
Multi-arbre
@fr
Multitree
@en