Related papers: Dyck paths and pattern-avoiding matchings
Motivated by recent results on quasi-Stirling permutations, which are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid the "crossing" patterns 1212 and 2121, we consider nonnesting permutations, defined as those that avoid…
We examine the enumeration of certain Motzkin objects according to the numbers of crossings and nestings. With respect to continued fractions, we compute and express the distributions of the statistics of the numbers of crossings and…
We exploit Krattenthaler's bijection between 123-avoiding permutations and Dyck paths to determine the Eulerian distribution over the set $S_n(123)$ of 123-avoiding permutations in $S_n$. In particular, we show that the descents of a…
We examine the possibility of approximating Maximum Vertex-Disjoint Shortest Paths. In this problem, the input is an edge-weighted (directed or undirected) $n$-vertex graph $G$ along with $k$ terminal pairs…
We consider the following problem: Given a set $S$ of $n$ distinct points in the plane, how many edge-disjoint plane straight-line spanning paths can be drawn on $S$? Each spanning path must be crossing-free, but edges from different paths…
For fixed $k\ge 2$, determining the order of magnitude of the number of edges in an $n$-vertex bipartite graph not containing $C_{2k}$, the cycle of length $2k$, is a long-standing open problem. We consider an extension of this problem to…
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant…
We define a class L_{n, k} of permutations that generalizes alternating (up-down) permutations and give bijective proofs of certain pattern-avoidance results for this class. As a special case of our results, we give two bijections between…
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In three essentially different cases, the numbers of such…
We initiate a systematic study of pattern avoidance in rectangulations. We give a formal definition of such patterns and investigate rectangulations that avoid $\top$-like patterns - the pattern $\top$ and its rotations. For every $L…
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…
We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…
In this note, we present constructive bijections from Dyck and Motzkin meanders with catastrophes to Dyck paths avoiding some patterns. As a byproduct, we deduce correspondences from Dyck and Motzkin excursions to restricted Dyck paths.
A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex belongs to at least ${n-1\choose 2} -…
Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…
In this paper, we show that for any positive integer $m$ and $k\in [2]$, let $G$ be a $(2m+2k+2)$-connected graph and let $a_1,\ldots , a_m, s, t$ be any distinct vertices of $G$, there are $k$ internally disjoint $s$-$t$ paths $P_1,…
We consider $k$-graphs on $n$ vertices, that is, $\mathcal{F}\subset \binom{[n]}{k}$. A $k$-graph $\mathcal{F}$ is called intersecting if $F\cap F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. In the present paper we prove that for $k\geq…
Chernyshev, Rauch and Rautenbach [Discrete Math., 2025] introduce forest cuts, i.e., vertex separators that induce a forest. They conjecture that, similar to a result by Chen and Yu [Discrete Math., 2002], every $n$-vertex graph with less…
The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each…