activity
20032008
most citedThe enumeration of simple permutations

75 citations · 100 across the 12 of their papers we have counts for

collaborators

12 papers

math.CO200819 cited

Overview of some general results in combinatorial enumeration

Martin Klazar

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These…

math.CO2007

Generalizations of Khovanskii's theorems on growth of sumsets in abelian semigroups

Vit Jelinek, Martin Klazar

We show that if is a lattice polytope in the nonnegative orthant of and is a coloring of the lattice points in the orthant such that the color depends only…

math.CO20071 cited

On growth rates of permutations, set partitions, ordered graphs and other objects

Martin Klazar

For classes O of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order cont (containment of permutations, subgraph relation etc.), w…

math.CO2005

Extensions of the linear bound in the Furedi-Hajnal conjecture

Martin Klazar, Adam Marcus

We present two extensions of the linear bound, due to Marcus and Tardos, on the number of 1's in an n by n 0-1 matrix avoiding a fixed permutation matrix. We first extend the linea…

math.NT2005

On the maximal order of numbers in the "factorisatio numerorum" problem

Martin Klazar, Florian Luca

Let m(n) be the number of ordered factorizations of n in factors larger than 1. We prove that for every eps>0 n^{rho} m(n) < exp[(log n)^{1/rho}/(loglog n)^{1+eps}] holds for all i…

math.CO20053 cited

On identities concerning the numbers of crossings and nestings of two edges in matchings

Martin Klazar

Let M,N be two matchings on [2n]={1, 2, ..., 2n} (possibly M=N) and for a nonnegative integer l let T(M,l) be the set of those matchings on [2n+2l] which can be obtained from M by…