Polytree

In mathematics, and more specifically in graph theory, a polytree^[1] (also called directed tree,^[2] oriented tree^[3] or singly connected network^[4]) is a directed acyclic graph whose underlying undirected graph is a tree. In other words, a polytree is formed by assigning an orientation to each edge of a connected and acyclic undirected graph.

A polytree

A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is acyclic.

A polytree is an example of an oriented graph.

The term polytree was coined in 1987 by Rebane and Pearl.^[5]

Related structures

• An arborescence is a directed rooted tree, i.e. a directed acyclic graph in which there exists a single source node that has a unique path to every other node. Every arborescence is a polytree, but not every polytree is an arborescence.
• A multitree is a directed acyclic graph in which the subgraph reachable from any node forms a tree. Every polytree is a multitree.
• The reachability relationship among the nodes of a polytree forms a partial order that has order dimension at most three. If the order dimension is three, there must exist a subset of seven elements ${\displaystyle x}$, ${\displaystyle y_{i}}$, and ${\displaystyle z_{i}}$ (for ${\displaystyle i=0,1,2}$) such that, for each ${\displaystyle i}$, either ${\displaystyle x\leq y_{i}\geq z_{i}}$ or ${\displaystyle x\geq y_{i}\leq z_{i}}$, with these six inequalities defining the polytree structure on these seven elements.^[6]
• A fence or zigzag poset is a special case of a polytree in which the underlying tree is a path and the edges have orientations that alternate along the path. The reachability ordering in a polytree has also been called a generalized fence.^[7]

Enumeration

The number of distinct polytrees on ${\displaystyle n}$ unlabeled nodes, for ${\displaystyle n=1,2,3,\dots }$, is

1, 1, 3, 8, 27, 91, 350, 1376, 5743, 24635, 108968, 492180, ... (sequence A000238 in the OEIS).

Sumner's conjecture

Sumner's conjecture, named after David Sumner, states that tournaments are universal graphs for polytrees, in the sense that every tournament with ${\displaystyle 2n-2}$ vertices contains every polytree with ${\displaystyle n}$ vertices as a subgraph. Although it remains unsolved, it has been proven for all sufficiently large values of ${\displaystyle n}$.^[8]

Applications

Polytrees have been used as a graphical model for probabilistic reasoning.^[1] If a Bayesian network has the structure of a polytree, then belief propagation may be used to perform inference efficiently on it.^[4][5]

The contour tree of a real-valued function on a vector space is a polytree that describes the level sets of the function. The nodes of the contour tree are the level sets that pass through a critical point of the function and the edges describe contiguous sets of level sets without a critical point. The orientation of an edge is determined by the comparison between the function values on the corresponding two level sets.^[9]

See also

• Glossary of graph theory