On the number of genus one labeled circle trees

zbMATH Open1159.05028arXivmath/0509407MaRDI QIDQ1010628FDOQ1010628

Authors: Karola Mészáros 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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 if it is not divisible by $n$ then it is divisible by $n/2$. Moreover, we explicitly characterize when each of these possibilities occur.

Full work available at URL: https://arxiv.org/abs/math/0509407

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Genus distributions for bouquets of circles
• Genus distribution for circle-like graph
• Total embedding distributions for bouquets of circles
• scientific article; zbMATH DE number 474668
• Hypercartes pointées sur le tore: Décompositions et dénombrements. (Rooted genus one hypermaps on the torus: Decompositions and enumerations)

zbMATH Keywords

e-graphe-reductionnumber of genus one labeled circle tree

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Cited In (1)

• Stirling decomposition of graph homology in genus \(1\)

This page was built for publication: On the number of genus one labeled circle trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010628)