# Tree-Decorated Planar Maps

@article{Fredes2020TreeDecoratedPM,
title={Tree-Decorated Planar Maps},
author={Luis Fredes and Avelio Sep'ulveda},
journal={Electron. J. Comb.},
year={2020},
volume={27},
pages={P1.66}
}
• Published 2020
• Mathematics, Computer Science
• Electron. J. Comb.
We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of tree decorated triangulations and quadrangulations with a given amount of faces and for a given size of the tree. Finally, we generalise the bijection to study other types of decorated planar maps and obtain explicit counting formulas for them.
3 Citations
Nonbijective scaling limit of maps via restriction
• Mathematics
• 2021
The main purpose of this work is to provide a framework for proving that, given a family of random maps known to converge in the Gromov–Hausdorff sense, then some (suitable) conditional families ofExpand
External diffusion-limited aggregation on a spanning-tree-weighted random planar map
• Mathematics, Physics
• 2019
Let $M$ be the infinite spanning-tree-weighted random planar map, which is the local limit of finite random planar maps sampled with probability proportional to the number of spanning trees theyExpand
Models of random subtrees of a graph
• Mathematics
• 2021
Consider a connected graph $G=(E,V)$ with $N=|V|$ vertices. A subtree of $G$ with size $n$ is a tree which is a subgraph of $G$, with $n$ vertices. When $n=N$, such a subtree is called a spanningExpand