On the number of genus one labeled circle trees (Q1010628)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of genus one labeled circle trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of genus one labeled circle trees |
scientific article |
Statements
On the number of genus one labeled circle trees (English)
0 references
7 April 2009
0 references
Summary: A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-reduction process whereby a special type of subtree, called an e-graph, is collapsed to an edge. We show that genus is invariant under e-reduction. Our main result is a classification of genus one labeled circle trees through e-reduction. Using this we prove a modified version of a conjecture of David Hough, namely, that the number of genus one labeled circle trees on \(n\) vertices is divisible by \(n\) or \(n/2\). Moreover, we explicitly characterize when each of these possibilities occur.
0 references
number of genus one labeled circle tree
0 references
e-reduction
0 references
e-graph
0 references
0.7262450456619263
0 references
0.7105791568756104
0 references
0.7049182057380676
0 references