Search arXivSearch

arXiv · 2510.03039

Labeled Plane Trees and Increasing Plane Trees

Abstract

The main aim of this paper is to establish a polynomial analogue of $(n+1)!C_n=2^n(2n-1)!!$ (with $C_n$ as the $n$-th Catalan number) in the setting of labeled plane trees and increasing plane trees. This analogue is formulated in terms of improper edges of labeled plane trees and yields explicit formulas for the generating polynomials defined on labeled plane trees refined by improper and proper edges, together with a root-degree refinement for trees rooted at $0$. To prove this result, we construct a new involution on labeled plane trees, which implies that the number of improper edges and the number of proper edges are equidistributed over the set of labeled plane trees. We further apply this involution to establish pairwise symmetry properties of multivariable polynomials defined on labeled plane trees involving several classes of leaves and interior vertices. More precisely, certain specializations of these polynomials are invariant under the subgroup of $S_6$ generated by the three disjoint transpositions $(12)$, $(34)$, and $(56)$. As special cases, our results recover the symmetry properties for plane trees and tip-augmented plane trees due to Dong, Du, Ji and Zhang. Finally, via the Koganov--Janson correspondence, improper edges of labeled plane trees correspond bijectively to improper arcs of quasi-Stirling permutations, leading to an explicit formula for the generating function defined on quasi-Stirling permutations refined by improper arcs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lora R. Du, Kathy Q. Ji, Dax T. X. Zhang. 2026-06-30. Labeled Plane Trees and Increasing Plane Trees. https://arxiv.org/abs/2510.03039

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Matching Complexes of Outerplanar Graphs

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres. This extends known results about trees and polygonal line tilings.

math.CO

Awesome graph parameters

For a graph $G$, we denote by $α(G)$ the size of a maximum independent set and by $ω(G)$ the size of a maximum clique in $G$. Our paper lies on the edge of two lines of research, related to $α$ and $ω$, respectively. One of them studies $α$-variants of graph parameters, such as $α$-treewidth or $α$-degeneracy. The second line deals with graph classes where some parameters are bounded by a function of $ω(G)$. A famous example of this type is the family of $χ$-bounded classes, where the chromatic number $χ(G)$ is bounded by a function of $ω(G)$. A Ramsey-type argument implies that if the $α$-variant of a graph parameter $ρ$ is bounded by a constant in a hereditary class $\mathcal{G}$, then $ρ$ is bounded by a function of $ω$ in $\mathcal{G}$. If the reverse implication also holds, we say that $ρ$ is awesome. Otherwise, we say that $ρ$ is awful. In the present paper, we identify a number of awesome and awful graph parameters, derive some algorithmic applications of awesomeness, and propose a number of open problems related to these notions.

math.CO

Perfect matchings and $A_α$-spectral radius in 1-binding graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. For $α\in[0,1)$, we use $A_α(G)$ and $ρ_α(G)$ to denote the $A_α$-matrix and the $A_α$-spectral radius of $G$, respectively. The binding number $\mbox{bind}(G)$ of $G$ is defined by $\mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}$. If $\mbox{bind}(G)\geq1$, then $G$ is called 1-binding. A perfect matching in $G$ is a set of nonadjacent edges covering every vertex of $G$. Tutte proved that a graph $G$ of even order has a perfect matching if and only if $o(G-S)\leq|S|$ holds for every $S\subseteq V(G)$ [W. Tutte, The factorization of linear graphs, J. Lond. Math. Soc. 22 (1947) 107--111]. In this paper, we use Tutte's result to prove that a connected 1-binding graph $G$ of even order $n$ with $n\geq n(α)$ has a perfect matching unless $G=K_1\vee(K_{n-5}\cup K_3\cup K_1)$ if $ρ_α(G)\geqρ_α(K_1\vee(K_{n-5}\cup K_3\cup K_1))$, where $n(α)$ is defined as follows: $n(α)=\max\{18,\frac{2+8α}{1-2α}\}$ if $α\in[0,\frac{1}{2})$, and $n(α)=18$ if $α=\frac{1}{2}$.

math.CO