Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees

DOI10.1016/0012-365X(83)90095-XzbMath0548.05024MaRDI QIDQ799683

Charles A. Jones

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

conductornumber of leaves

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Cites Work

• Periodic oscillations of coefficients of power series that satisfy functional equations
• (g//0,g//1,\dots ,g//k)-trees and unary OL systems
• On the correspondence between AVL trees and brother trees
• Representations of integers by linear forms in nonnegative integers
• On the linear diophantine problem of Frobenius.
• On a Problem of Partitions II
• On a Problem of Partitions

This page was built for publication: Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees