Combinatorics of partial derivatives.
Compositions of graphs revisited.
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Counting peaks and valleys in a partition of a set.
Counting set systems by weight.
Counting subwords in a partition of a set.
Counting the number of unavoidable sets of a given size in a finite set of integers.
Crossings and nestings in tangled diagrams.
Cyclic permutations of sequences and uniform partitions.
Derangements and Euler's difference table for .
Diagonals on the permutahedra, multiplihedra and associahedra.
Differential equations forp,q-Touchard polynomials
In this paper, we present differential equation for the generating function of the p, q-Touchard polynomials. An application to ordered partitions of a set is investigated.
Distribution of crossings, nestings and alignments of two edges in matchings and partitions.
Dualization of van Douwen diagram
Eigenschaften des Halbverbandes der Zerlegungen in einer Menge
Enumerative properties of generalized associahedra.
Equidecomposability of Jordan domains under groups of isometries
Let denote the isometry group of . We prove that if G is a paradoxical subgroup of then there exist G-equidecomposable Jordan domains with piecewise smooth boundaries and having different volumes. On the other hand, we construct a system of Jordan domains with differentiable boundaries and of the same volume such that has the cardinality of the continuum, and for every amenable subgroup G of , the elements of are not G-equidecomposable; moreover, their interiors are not G-equidecomposable...
Equitable coloring of Kneser graphs
The Kneser graph K(n,k) is the graph whose vertices correspond to k-element subsets of set {1,2,...,n} and two vertices are adjacent if and only if they represent disjoint subsets. In this paper we study the problem of equitable coloring of Kneser graphs, namely, we establish the equitable chromatic number for graphs K(n,2) and K(n,3). In addition, for sufficiently large n, a tight upper bound on equitable chromatic number of graph K(n,k) is given. Finally, the cases of K(2k,k) and K(2k+1,k) are...
Erdős-Ko-Rado theorems for uniform set-partition systems.
Exponential triples.