Martin Klazar

Orcid: 0000-0002-8808-4485

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs.
Eur. J. Comb., October, 2023

2022
Are the Catalan Numbers a Linear Recurrence Sequence?
Am. Math. Mon., 2022

2011
Embedding dualities for set partitions and for relational structures.
Eur. J. Comb., 2011

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

2008
On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects.
Electron. J. Comb., 2008

Generalizations of Khovanskiĭ's theorems on the growth of sumsets in Abelian semigroups.
Adv. Appl. Math., 2008

2007
Generalizations of Khovanski's theorem on growth of sumsets in abelian semigroups: (extended abstract).
Electron. Notes Discret. Math., 2007

Extensions of the linear bound in the Füredi-Hajnal conjecture.
Adv. Appl. Math., 2007

2006
On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings.
SIAM J. Discret. Math., 2006

2005
Counting Set Systems by Weight.
Electron. J. Comb., 2005

2004
On the least exponential growth admitting uncountably many closed permutation classes.
Theor. Comput. Sci., 2004

Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences.
Eur. J. Comb., 2004

Extremal problems for ordered hypergraphs: small patterns and some enumeration.
Discret. Appl. Math., 2004

2003
Counting Even and Odd Partitions.
Am. Math. Mon., 2003

Bell numbers, their relatives, and algebraic differential equations.
J. Comb. Theory A, 2003

A bijection between nonnegative words and sparse abba-free partitions.
Discret. Math., 2003

Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings.
Adv. Appl. Math., 2003

2002
On Growth Rates of Closed Permutation Classes.
Electron. J. Comb., 2002

2000
Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind.
Eur. J. Comb., 2000

Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs.
Electron. J. Comb., 2000

1999
Extremal problems for colored trees and Davenport-Schinzel sequences.
Discret. Math., 1999

1998
On numbers of Davenport-Schinzel sequences.
Discret. Math., 1998

On Trees and Noncrossing Partitions.
Discret. Appl. Math., 1998

1997
Addendum Twelve Countings with Rooted Plane Trees.
Eur. J. Comb., 1997

Twelve Countings with Rooted Plane Trees.
Eur. J. Comb., 1997

Combinatorial aspects of Davenport-Schinzel sequences.
Discret. Math., 1997

On well quaasiordering of finite languages.
Discret. Math., 1997

On the maximum lengths of Davenport-Schinzel sequences.
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.
Eur. J. Comb., 1996

Extremal functions for sequences.
Discret. Math., 1996

1994
A Linear Upper Bound in Extremal Theory of Sequences.
J. Comb. Theory A, 1994

Generalized Davenport-Schinzel Sequences.
Comb., 1994

1992
Generalized Davenport-Schinzel sequences with linear upper bound.
Discret. Math., 1992


  Loading...