75 citations · 80 across the 9 of their papers we have counts for
4 papers · 1 filter
On the least exponential growth admitting uncountably many closed permutation classes
Martin Klazar
We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.
Extremal problems for ordered hypergraphs: small patterns and some enumeration
Martin Klazar
We investigate extremal functions ex_e(F,n) and ex_i(F,n) counting maximum numbers of edges and maximum numbers of vertex-edge incidences in simple hypergraphs H which have n verti…
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
Martin Klazar
We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generall…
The enumeration of simple permutations
M. H. Albert, M. D. Atkinson, M. Klazar
A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results inclu…