Matpic
mathematics, in pictures
Ladder

Labelled trees — the ladder

One essay so far against this idea. A ladder is the distinct arguments that stand against one idea, and this one has room to grow.
  1. 1234123412341234123412341234123412341234123412341234123412341234all 16 trees on 4 labelled points, found by taking every set of 3 edges and keeping the ones with no cycle4 to the power 2 is 16, which is the count — and the same rule gives 1,296 on six points, which is why they are not all drawn

    Sixteen trees on four points

    How many ways are there to connect n labelled points into a single tree? The answer is n to the power n minus two, which is a strange enough formula to demand an explanation — and the explanation is a code that turns every tree into a short list of numbers, and every short list of numbers back into a tree.

    rung 1 · discrete

All ladders