<div id="cookie_notice" class="sw-cookie-notice sw--padding-vert-4 sw--padding-hor-1 sw-dms--box-shadow--big">
<div class="sw-dms--color-white sw-grid-flex sw-grid-flex--wrap-mob sw-grid-flex--wrap--tab">
<div class="sw-cookie-notice__text--mob sw--padding-left-8 sw--font-size-14 sw-grid-flex__cell-5-7 sw-grid-flex__cell-1-1--mob sw-grid-flex__cell-1-1--tab">
<div class="sw-grid-flex__cell-2-7 sw-grid-flex__cell-1-1--mob sw-grid-flex__cell-1-1--tab">
<a class="sw-dms-button noty_close sw--padding-hor-7 sw--position-absolute sw--position-right sw--margin-right-13 sw--hide-mobile sw--hide-tablet" data-sw-set-cookie="euCookie">OK</a>
<a class="sw-cookie-notice__btn--mob sw-cookie-notice__btn--tab sw-dms-button noty_close sw--padding-hor-7 sw--margin-vert-3 sw--hide-desktop" data-sw-set-cookie="euCookie">OK</a>
A mathematical tree is a graph (vertices connected by edges) with no loops. A tree is regular if the number of edges attached to each vertex is the same, and that number is called the valence of the graph. Trivalent means the valence is 3. An infinite trivalent tree starts from some vertex, and has three edges coming out of it. The ends of each of those 3 edges are vertices out of which two more edges extend (to make the valence 3), giving 6 new vertices and 6 more edges. The ends of each of those 6 edges are vertices out of which two more edges extend, giving 12 new vertices and 12 more edges. That process goes on ``ad infinitum" (forever), producing the full trivalent tree. To draw part of that tree we have to make the lengths of the edges shrink as we go out from the center vertex, since otherwise they will overlap. This pendant goes out five steps, showing 48 ``ends" and a total of 93 edges. A loop for a chain has been added to the back of one of the central edges, but that should not be visible when it is worn. This is a flat linear version of this pendant. A new curved version has been designed and will appear soon.