Historical Note on a Recurrent Combinatorial Problem
From MaRDI portal
Cited in
(20)- Lattice paths in regions with the Catalan property
- Polytope pairs and their relationship to linear programming
- On general dissections of a polygon
- Catalan, Motzkin, and Riordan numbers
- Experimental results on quadrangulations of sets of fixed points
- Explicit construction of self-dual 4-manifolds
- The number of clone orderings
- Disjoint compatibility graph of non-crossing matchings of points in convex position
- Prime and prime power divisibility of Catalan numbers
- The number of labeled dissections of a k-ball
- BOUNDARY TRIANGULATIONS APPROXIMATING DEVELOPABLE SURFACES THAT INTERPOLATE A CLOSED SPACE CURVE
- Deux propriétés combinatoires des nombres de Schröder
- Counting equivalence classes of vertex pairs modulo the dihedral action on the associahedron
- On acyclic simplicial complexes
- Polytopes, graphs, and complexes
- Motzkin numbers
- Simplicial properties of the set of planar binary trees
- Chords, trees and permutations
- A history and a survey of lattice path enumeration
- Raney and Catalan
This page was built for publication: Historical Note on a Recurrent Combinatorial Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510576)