Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
From MaRDI portal
Publication:403161
DOI10.1016/j.aam.2014.04.001zbMath1295.05036arXiv1307.6440MaRDI QIDQ403161
Publication date: 29 August 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6440
05A15: Exact enumeration problems, generating functions
05C30: Enumeration in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05A16: Asymptotic enumeration
Related Items
Linear $k$-Chord Diagrams, Perfect matchings with crossings, The combinatorics of a tree-like functional equation for connected chord diagrams, Perfect matchings with crossings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal fillings of Moon polyominoes, simplicial complexes, and Schubert polynomials
- Multitriangulations as complexes of star polygons
- A Turán-type theorem on chords of a convex polygon
- On convergence rates in the central limit theorems for combinatorial structures
- Analytic combinatorics of non-crossing configurations
- Partitions with \(k\) crossings
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- On an asymptotic method in enumeration
- A generalization of diagonal flips in a convex polygon
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Uniform random sampling of planar graphs in linear time
- Crossings and nestings of matchings and partitions
- Singularity Analysis of Generating Functions
- A Bijection for Rooted Maps on Orientable Surfaces
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- The number of connected sparsely edged graphs
- The number of connected sparsely edged graphs. II. Smooth graphs and blocks
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
