scientific article; zbMATH DE number 2232270

zbMATH Open1080.05004MaRDI QIDQ5707698FDOQ5707698

Authors: Michael Drmota 

Publication date: 24 November 2005

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3865301
• Trees
• scientific article; zbMATH DE number 1789915
• On an asymptotic method in enumeration
• Analytic combinatorics of non-crossing configurations

zbMATH Keywords

enumerationgenerating functionssingularity analysis

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Cited In (39)

• Progress on the adjacent vertex distinguishing edge coloring conjecture
• Analysis of three graph parameters for random trees
• Exploring string patterns with trees
• On the number of vertices with a given degree in a Galton-Watson tree
• The uplift principle for ordered trees
• Entropy compression versus Lovász local lemma
• A subclass of labeled ternary trees and its generalization
• Enumeration results for alternating tree families
• Combinatorial properties of triplet covers for binary trees
• The asymptotic behaviour of the number of trees in certain classes
• Title not available (Why is that?)
• Recursion and growth estimates in renormalizable quantum field theory
• An expansion of the homoclinic splitting matrix for the rapidly, quasiperiodically, forced pendulum
• The number of rooted circuit boundary maps
• A distributional study of the path edge-covering numbers for random trees
• Philippe Flajolet's early work in combinatorics
• Title not available (Why is that?)
• Acyclic coloring of graphs without bichromatic long path
• Hilbert series in the category of trees with contractions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The combinatorics of even trees
• Scaling behaviour of quiver quantum mechanics
• A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider
• A new method for counting trees with vertex partition
• Asymptotic results on Hoppe trees and their variations
• Title not available (Why is that?)
• The combinatorics of discrete time-trees: theory and open problems
• Localization in quiver moduli spaces
• Combinatorics of non-ambiguous trees
• A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider
• Acyclic edge-coloring using entropy compression
• Trees
• Moser-Tardos resampling algorithm, entropy compression method and the subset gas
• Trees with flowers: a catalog of integer partition and integer composition trees with their asymptotic analysis
• Title not available (Why is that?)
• The number of ways to assemble a graph
• On the number of matchings of a tree
• On the combinatorics of leftist trees

This page was built for publication:

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