top of page
  • Jesse Sakari Hyttinen

Enumerating h21 - Jesse Hyttinen

Updated: Apr 20, 2021


Hi and welcome to the Matladpi blog! In this post I will concentrate on the enumeration of homeomorphically irreducible trees, calculating the quantity of these for size v = 21. Here is a picture:



So, first we evaluated the number of forms for branches of sizes 1 - 10 with the branch form generator (BFG). The size 11 case will be used in some later posts.

Next, we will enumerate h21 by using the algorithm BFG -> TGA, where TGA stands for tree generation algorithm. 

Here are the pictures: 







So h21 = 5671. Njäf! said.

I am Jesse Sakari Hyttinen and I will see you in the next post!

5 views0 comments

Recent Posts

See All

Skill levels in Treespeak

Examples of Treespeak times, index +1 Novice: Tsm 0-11 --- t >= 10s / rooted tree Apprentice: Tsm 0-11 --- t € [7s ; 10s[ / rooted tree Journeyman: Tsm 0-11 --- t € [5s ; 7s[ / rooted tree Adept: Ts

A new book - Jesse Hyttinen

I have now written five math books, and may write another one in the following year. The current book includes new viewpoints about very well known numbers. Examples include pi and Euler's number. The

Generating r9 part 2 - Jesse Hyttinen

Hi and welcome to the Matladpi blog! We continue the generation process in the column 7: =1+7+1 =1+(1+2+1*4)+1 =1+(1+2*2+1*2)+1 =1+(1+2*3)+1 =1+(1+3+1*3)+1 =1+(1+(1+2)+1*3)+1 =1+(1+3+2+1)+1 =1+(1+(1+2

Post: Blog2_Post
bottom of page