分からない問題はここに書いてね462

分からない問題はここ ..

937:１３２人目の素数さん
20/09/05 20:41:15.76 BtVdvkls.net
>>911
ちなみに、英語で出版されている同著者らによる本の該当箇所には以下のように書かれています：
Theorem 8.2.3 Every tree on n nodes has n - 1 edges.
8.2.2 Let G be a tree, which we consider as the network of roads in a medieval
country, with castles as nodes. The king lives at node r. On a certain day, the
lord of each castle sets out to visit the king. Argue carefully that soon after they
have left their castles, there will be exactly one lord on each edge. Give a proof
of Theorem 8.2.3 based on this.
8.2.2. Any edge has only one lord, since if there were two, they would
have to start from different ends, and they would have then two ways to
get to the king: either continuing as they started, or waiting for the other
and walking together. Similarly, an edge with no lord would have to lead
to two different ways of walking.

次ページ

続きを表示

1を表示