相关论文: Enumerating several statistics of r-Colored Dyck p…

The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved…

A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Let $c$ be an edge-colouring of a graph $G$ such that for every vertex $v$ there are at least $d \ge 2$ different colours on edges incident to $v$. We prove that $G$ contains a properly coloured path of length 2d or a properly coloured…

Motzkin paths of order-$\ell$ are a generalization of Motzkin paths that use steps $U=(1,1)$, $L=(1,0)$, and $D_i=(1,-i)$ for every positive integer $i \leq \ell$. We further generalize order-$\ell$ Motzkin paths by allowing for various…

Suppose that the vertices of a regular graph are coloured red and blue with an equal number of each (we call this a balanced colouring). Since the graph is undirected, the number of edges from a red vertex to a blue vertex is clearly the…

Skew Dyck paths are a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ a south-west step $(-1,-1)$ is also allowed, provided that the path does not intersect itself. Replacing the south-west step by a red south-east…

We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…

A dispersed Dyck path (DDP) of length n is a lattice path on $N\times N$ from (0,0) to (n,0) in which the following steps are allowed: "up" (x, y) $\to$ (x+1, y+1); "down" (x, y) $\to$ (x+1, y-1); and "right" (x,0) $\to$ (x+1,0). An ascent…

We show bijectively that Dyck paths with all peaks at odd height are counted by the Motzkin numbers and Dyck paths with all peaks at even height are counted by the Riordan numbers.

Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $\ell$ is a sequence $p_1, \dots, p_\ell$ of $\ell$ points from $P$…

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

Raised $k$-Dyck paths are a generalization of $k$-Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised $k$-Dyck paths from $(0,\alpha)$ to $(\ell,\beta)$ for all…

We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…

A {\em k-generalized Dyck path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(k, 0)$ for a given integer $k\geq 0$, up-steps $(1,1)$, and…

In this research, the exact results on $r$-dynamic coloring of lexicographic product of path with star graph, path with double star graph, path with triple star graph and finally complete graph with path are obtained.

For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same…

We say that a sequence $a_1 \cdots a_{2t}$ of integers is repetitive if $a_i = a_{i+t}$ for every $i\in\{1,\ldots,t\}$. A walk in a graph $G$ is a sequence $v_1 \cdots v_r$ of vertices of $G$ in which $v_iv_{i+1}\in E(G)$ for every…

In their 1997 paper titled ``Fruit Salad", Gy\'{a}rf\'{a}s posed the following conjecture: there exists a constant $k$ such that if each path of a graph spans a $3$-colourable subgraph, then the graph is $k$-colourable. It is noted that…

We consider the problem of enumerating Dyck paths staying weakly above the x-axis with a limit to the number of consecutive up steps, or a limit to the number of consecutive down steps. We use Finite Operator Calculus to obtain formulas for…