The growth-rate asymptotic conjecture for tree-pattern avoidance
Statement
Let be a set of labels, and let denote the set of labelled tree patterns on . For a pattern , write for the labelled trees of size avoiding , and for all labelled trees of size .
Growth-rate asymptotic conjecture. For every set of labels , there exists an integer such that, for every pattern with at least internal vertices, there are numbers and satisfying
This conjecture generalises Warlimont's conjecture for consecutive patterns to tree patterns. It predicts a precise exponential asymptotic for the proportion of trees avoiding every sufficiently large pattern, extending the paper's earlier positive-growth results.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.