The following pages link to Martin Klazar (Q627537):
Displaying 50 items.
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Embedding dualities for set partitions and for relational structures (Q648966) (← links)
- Twelve countings with rooted plane trees (Q674629) (← links)
- On the maximal order of numbers in the ``factorisatio numerorum'' problem (Q880071) (← links)
- Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups (Q928780) (← links)
- Non-holonomicity of sequences defined via elementary functions (Q938207) (← links)
- On growth rates of permutations, set partitions, ordered graphs and other objects (Q1010798) (← links)
- Generalized Davenport-Schinzel sequences with linear upper bound (Q1201254) (← links)
- Extremal problems for colored trees and Davenport-Schinzel sequences (Q1292853) (← links)
- A linear upper bound in extremal theory of sequences (Q1337178) (← links)
- Generalized Davenport-Schinzel sequences (Q1343170) (← links)
- On well quasiordering of finite languages (Q1356526) (← links)
- Combinatorial aspects of Davenport-Schinzel sequences (Q1356764) (← links)
- Addendum to: Twelve countings with rooted plane trees (Q1367602) (← links)
- On trees and noncrossing partitions (Q1383385) (← links)
- Non-P-recursiveness of numbers of matchings or linear chord diagrams with many crossings (Q1398290) (← links)
- Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences (Q1422400) (← links)
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs (Q1572761) (← links)
- On numbers of Davenport-Schinzel sequences (Q1584258) (← links)
- Counting set systems by weight (Q1773202) (← links)
- On integrality and periodicity of the Motzkin numbers (Q1774133) (← links)
- On growth rates of closed permutation classes (Q1871365) (← links)
- Bell numbers, their relatives, and algebraic differential equations (Q1873813) (← links)
- A bijection between nonnegative words and sparse \(abba\)-free partitions (Q1874381) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- Extremal problems for ordered hypergraphs: small patterns and some enumeration (Q1887050) (← links)
- On \(abab\)-free and \(abba\)-free set partitions (Q1908273) (← links)
- Extremal functions for sequences (Q1916110) (← links)
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind (Q1972357) (← links)
- The Potts model and chromatic functions of graphs (Q2444869) (← links)
- Extensions of the linear bound in the Füredi-Hajnal conjecture (Q2643869) (← links)
- (Q3023983) (← links)
- Overview of some general results in combinatorial enumeration (Q3084736) (← links)
- (Q3137399) (← links)
- (Q3149647) (← links)
- (Q3428609) (← links)
- (Q3433929) (← links)
- Generalizations of Khovanskiĭ's theorem on growth of sumsets in abelian semigroups (Q3503483) (← links)
- (Q4263474) (← links)
- (Q4285969) (← links)
- Counting Even and Odd Partitions (Q4469194) (← links)
- On some arithmetic properties of polynomial expressions involving Stirling numbers of the second kind (Q4484402) (← links)
- (Q4502539) (← links)
- (Q4881920) (← links)
- (Q4897525) (← links)
- Are the Catalan Numbers a Linear Recurrence Sequence? (Q5037308) (← links)
- On Identities Concerning the Numbers of Crossings and Nestings of Two Edges in Matchings (Q5426884) (← links)
- A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs (Q6170800) (← links)
- Birch's theorem: if f(n) is multiplicative and has a non-decreasing normal order then f(n)=n^{alpha} (Q6274896) (← links)
- Real analysis without uncountable sets (Q6508490) (← links)
