On the number of induced subgraphs of trees

DOI10.1016/S0012-365X(96)00250-6zbMath0871.05033OpenAlexW2087117170MaRDI QIDQ1356487

John W. Moon

Publication date: 9 September 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00250-6

zbMATH Keywords

treesnumber of induced subgraphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items

Central Limit Theorems for Additive Tree Parameters with Small Toll Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of coloured plane trees with a given type partition
• The average height of binary trees and other simple trees
• Patterns and pattern-matching in trees: An analysis
• The Generalisation of Tutte's Result for Chromatic Trees, by Lagrangian Methods
• On the Altitude of Nodes in Random Trees
• The Number of Planted Plane Trees with a Given Partition