The reciprocal super Catalan matrix has entries [...] . Explicit formulæ for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, q-analogues are also presented.
Let denote the minimum possible number of leaves in a tree of order and diameter Lesniak (1975) gave the lower bound for When is even, But when is odd, is smaller than in general. For example, while In this note, we determine using new ideas. We also consider the converse problem and determine the minimum possible diameter of a tree with given order and number of leaves.
This paper deals with weighted set systems (V,,q), where V is a set of indices, and the weight q is a nonnegative integer function on . The basic idea of the paper is to apply weighted set systems to formulate restrictions on intersections. It is of interest to know whether a weighted set system can be represented by set intersections. An intersection representation of (V,,q) is defined to be an indexed family of subsets of a set S such that for each E ∈ . A necessary condition for the existence...
We give a presentation (in terms of generators and relations) of the ring of multisymmetric functions that holds for any commutative ring , thereby answering a classical question coming from works of F. Junker [J1, J2, J3] in the late nineteen century and then implicitly in H. Weyl book “The classical groups” [W].
The Ryjáček closure is a powerful tool in the study of Hamiltonian properties of claw-free graphs. Because of its usefulness, we may hope to use it in the classes of graphs defined by another forbidden subgraph. In this note, we give a negative answer to this hope, and show that the claw is the only forbidden subgraph that produces non-trivial results on Hamiltonicity by the use of the Ryjáček closure.
A degree monotone path in a graph G is a path P such that the sequence of degrees of the vertices in the order in which they appear on P is monotonic. The length (number of vertices) of the longest degree monotone path in G is denoted by mp(G). This parameter, inspired by the well-known Erdős- Szekeres theorem, has been studied by the authors in two earlier papers. Here we consider a saturation problem for the parameter mp(G). We call G saturated if, for every edge e added to G, mp(G + e) > mp(G),...