Extremal statistics on non-crossing configurations

DOI10.1016/j.disc.2014.03.016zbMath1288.05012OpenAlexW3021936170MaRDI QIDQ2449168

Marc Noy, Anna de Mier, Michael Drmota

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.016

zbMATH Keywords

analytic combinatoricsextremal parameternoncrossing configuration

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Other designs, configurations (05B30)

Related Items (5)

Enumeration of bipartite non-crossing geometric graphs ⋮ The CRT is the scaling limit of random dissections ⋮ New production matrices for geometric graphs ⋮ Simply Generated Non-Crossing Partitions ⋮ Production matrices for geometric graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Degree distribution in random planar graphs
• On properties of random dissections and triangulations
• The average height of binary trees and other simple trees
• Properties of random triangulations and trees
• Analytic combinatorics of non-crossing configurations
• Statistics on non-crossing trees
• The distribution of the maximum vertex degree in random planar maps
• Vertices of given degree in series-parallel graphs
• The distribution of height and diameter in random non-plane binary trees
• Random Trees
• The Maximum Degree of Series-Parallel Graphs

This page was built for publication: Extremal statistics on non-crossing configurations