Construction of a family of Fibonacci-type trees that arise in the study of sparse amoeba graphs. Concretely, it is the first example of an infinite family of global amoeba trees of arbitrary maximum degree ([2, Section 3]).
Recently, it was found that these trees are actually local amoebas, which is stronger (see [1]). That project was in part inspired by the computations present in this repository.
[1] Eslava, L., Hansberg, A., _, Ventura, D., New recursive constructions of amoebas and their balancing number, Aequationes Mathematicae, 2023. Link
[2] Caro, Y., Hansberg, A., Montejano, A. (2023). Graphs isomorphisms under edge-replacements and the family of amoebas. Electronic Journal of Combinatorics 30(3) P3.9 Link