Pages that link to "Item:Q1300975"
From MaRDI portal
The following pages link to Analytic combinatorics of non-crossing configurations (Q1300975):
Displayed 22 items.
- Ennea-algebras (Q706015) (← links)
- Dyck paths with coloured ascents (Q925029) (← links)
- Flips in planar graphs (Q950400) (← links)
- Counting polygon dissections in the projective plane (Q953906) (← links)
- Bijections for a class of labeled plane trees (Q966126) (← links)
- Identities for non-crossing graphs and multigraphs (Q998488) (← links)
- Gray codes for non-crossing partitions and dissections of a convex polygon (Q1028124) (← links)
- 2-noncrossing trees and 5-ary trees (Q1045110) (← links)
- Consecutive patterns in permutations (Q1398289) (← links)
- Enumerating a class of lattice paths (Q1408864) (← links)
- Quadri-algebras (Q1886435) (← links)
- Extremal problems for ordered hypergraphs: small patterns and some enumeration (Q1887050) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- On planar path transformation (Q2379998) (← links)
- Enumeration and limit laws for series-parallel graphs (Q2461767) (← links)
- 2-binary trees: bijections and related issues (Q2470000) (← links)
- Congruences for Catalan and Motzkin numbers and related sequences (Q2490154) (← links)
- Extensions of the linear bound in the Füredi-Hajnal conjecture (Q2643869) (← links)
- On the Congruences of Some Combinatorial Numbers (Q3528878) (← links)
- Analytic solution of Hedin’s equations in zero dimensions (Q3529702) (← links)
- Noncrossing trees are almost conditioned Galton–Watson trees (Q4534222) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)