Asymptotic results on Klazar set partition avoidance
Combinatorics
2023-06-22 v6
Abstract
We establish asymptotic bounds for the number of partitions of avoiding a given partition in Klazar's sense, obtaining the correct answer to within an exponential for the block case. This technique also enables us to establish a general lower bound. Additionally, we consider a graph theoretic restatement of partition avoidance problems, and propose several conjectures.
Cite
@article{arxiv.1608.02279,
title = {Asymptotic results on Klazar set partition avoidance},
author = {Ryan Alweiss},
journal= {arXiv preprint arXiv:1608.02279},
year = {2023}
}