Related papers: Foata's Bijection for Tree-Like Structures
We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…
In SIAM Review 10, page 273, D. W. Matula described a bijection between N and the set of topological rooted trees; the number is called the Matula number of the rooted tree. The Gutman-Ivic-Matula (GIM) function g(n) computes the number of…
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are…
We construct generating trees with one, two, and three labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation,…
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…
Following the treatment of Blass and Sagan, we present an algorithmic bijection between the Eulerian equivalence classes of totally cyclic orientations and the spanning trees without internal activity edges for a given graph.
This paper studies the structure of graphs with given tree-width and excluding a fixed complete bipartite subgraph, which generalises the bounded degree setting. We give a new structural description of such graphs in terms of so-called…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via…
Two subfamilies of Motzkin paths, with the same numbers of up, down, horizontal steps were known to be equinumerous with ternary trees and related objects. We construct a bijection between these two families that does not use any auxiliary…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
We present a characterization of spaces of strictly decreasing functions on trees in terms of bisequentiality. This characterization answers Questions 6.1 and 6.2 of "A filter on a collection of finite sets and Eberlein compacta" by T.…
To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…
Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations…
Fano Bott manifolds bijectively correspond to signed rooted forests with some equivalence relation. Using this bijective correspondence, we enumerate the isomorphism classes of Fano Bott manifolds and the diffeomorphism classes of…
In this short paper, we give bijective proofs of two recent equidistribution results connecting cyclic and linear statistics in the spirit of the Foata's ``transformation fondamentale''.
Triangulations of the 5-gon with no separating triangle nor quadrangle, so called 5c-triangulations, are a planar map family closely related to 5-connected planar triangulations. We show that 5c-triangulations are in bijection with…