The Tree Known for Its Bark

Fig. 9.1 In many ways a tree is the simplest non-trivial type of graph; as we shall see in Theorem 9A, it has several 'nice' properties such as the fact that any two vertices are connected by a unique path. In trying to prove a general result or test a general conjecture in graph theory, it is sometimes convenient to start by trying to prove the corresponding result for a tree; in fact, there are several conjectures which have not been proved for arbitrary graphs but which are known to be true for trees. †The last tree in Fig. 9.1 is particularly well known for its bark.

A graph theory textbook shows several tree graphs and explains why trees are useful in proving results about graphs. The punchline is the footnote that the last tree is well known for its “bark,” a pun on tree bark and the sound dogs make, used as a nerdy academic joke.

• @memetutorial / 17592 2023-08-14