Martin Klazar

According to our database, Martin Klazar authored at least 33 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs.

Jaroslav Hancl, Martin Klazar

Eur. J. Comb., October, 2023

2022

Are the Catalan Numbers a Linear Recurrence Sequence?

Martin Klazar, Richard Horský

Am. Math. Mon., 2022

2011

Embedding dualities for set partitions and for relational structures.

Vít Jelínek, Martin Klazar

Eur. J. Comb., 2011

Exact Algorithms for <i>L</i>(2, 1)-Labeling of Graphs.

Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Algorithmica, 2011

2008

On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects.

Martin Klazar

Electron. J. Comb., 2008

Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups.

Vít Jelínek, Martin Klazar

Adv. Appl. Math., 2008

2007

Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).

Vít Jelínek, Martin Klazar

Electron. Notes Discret. Math., 2007

Extensions of the linear bound in the Füredi-Hajnal conjecture.

Martin Klazar, Adam Marcus

Adv. Appl. Math., 2007

2006

On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings.

Martin Klazar

SIAM J. Discret. Math., 2006

2005

Counting Set Systems by Weight.

Martin Klazar

Electron. J. Comb., 2005

2004

On the least exponential growth admitting uncountably many closed permutation classes.

Martin Klazar

Theor. Comput. Sci., 2004

Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences.

Martin Klazar

Eur. J. Comb., 2004

Extremal problems for ordered hypergraphs: small patterns and some enumeration.

Martin Klazar

Discret. Appl. Math., 2004

2003

Counting Even and Odd Partitions.

Martin Klazar

Am. Math. Mon., 2003

Bell numbers, their relatives, and algebraic differential equations.

Martin Klazar

J. Comb. Theory A, 2003

A bijection between nonnegative words and sparse abba-free partitions.

Jan Nemecek, Martin Klazar

Discret. Math., 2003

Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings.

Martin Klazar

Adv. Appl. Math., 2003

2002

On Growth Rates of Closed Permutation Classes.

Tomás Kaiser, Martin Klazar

Electron. J. Comb., 2002

2000

Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind.

Martin Klazar

Eur. J. Comb., 2000

Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs.

Martin Klazar

Electron. J. Comb., 2000

1999

Extremal problems for colored trees and Davenport-Schinzel sequences.

Martin Klazar

Discret. Math., 1999

1998

On numbers of Davenport-Schinzel sequences.

Martin Klazar

Discret. Math., 1998

On Trees and Noncrossing Partitions.

Martin Klazar

Discret. Appl. Math., 1998

1997

Addendum Twelve Countings with Rooted Plane Trees.

Martin Klazar

Eur. J. Comb., 1997

Twelve Countings with Rooted Plane Trees.

Martin Klazar

Eur. J. Comb., 1997

Combinatorial aspects of Davenport-Schinzel sequences.

Martin Klazar

Discret. Math., 1997

On well quaasiordering of finite languages.

Martin Klazar

Discret. Math., 1997

On the maximum lengths of Davenport-Schinzel sequences.

Martin Klazar

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

On abab-free and abba-free Set Partitions.

Martin Klazar

Eur. J. Comb., 1996

Extremal functions for sequences.

Martin Klazar

Discret. Math., 1996

1994

A Linear Upper Bound in Extremal Theory of Sequences.

Martin Klazar

J. Comb. Theory A, 1994

Generalized Davenport-Schinzel Sequences.

Martin Klazar, Pavel Valtr

Comb., 1994

1992

Generalized Davenport-Schinzel sequences with linear upper bound.

Radek Adamec, Martin Klazar, Pavel Valtr

Discret. Math., 1992