Pages that link to "Item:Q1300975"
From MaRDI portal
The following pages link to Analytic combinatorics of non-crossing configurations (Q1300975):
Displayed 50 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- On the number of crossing-free partitions (Q359753) (← links)
- Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings (Q403161) (← links)
- A decomposition algorithm for noncrossing trees (Q405065) (← links)
- Production matrices for geometric graphs (Q510608) (← links)
- Consecutive pattern avoidances in non-crossing trees (Q607683) (← links)
- On properties of random dissections and triangulations (Q653837) (← links)
- Ennea-algebras (Q706015) (← links)
- Enumeration and limit laws of dissections on a cylinder (Q708420) (← links)
- Locally oriented noncrossing trees (Q888594) (← 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)
- Characteristic polynomials of production matrices for geometric graphs (Q1689984) (← links)
- Noncrossing partitions, noncrossing graphs, and \(q\)-permanental equations (Q1690673) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- On the number of labeled outerplanar \(k\)-cycle blocks (Q1744336) (← links)
- Combalgebraic structures on decorated cliques (Q1745105) (← links)
- Combinatorics of the categories of noncrossing partitions (Q1745131) (← links)
- New results on production matrices for geometric graphs (Q1792103) (← links)
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs (Q1800412) (← links)
- Quadri-algebras (Q1886435) (← links)
- Extremal problems for ordered hypergraphs: small patterns and some enumeration (Q1887050) (← links)
- A refinement of leaves on noncrossing trees (Q1938892) (← links)
- Exceptional sequences over path algebras of type \(A_n\) and non-crossing spanning trees. (Q1946637) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Operads of decorated cliques. I: Construction and quotients (Q2055236) (← links)
- Decomposition and merging algorithms for noncrossing forests (Q2062886) (← links)
- Enumeration of bipartite non-crossing geometric graphs (Q2142691) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Partitions of unity in \(\mathrm{SL}(2,\mathbb Z)\), negative continued fractions, and dissections of polygons (Q2319752) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Lower bounds on the maximum number of non-crossing acyclic graphs (Q2346577) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- On planar path transformation (Q2379998) (← links)
- Random stable laminations of the disk (Q2447339) (← links)
- Extremal statistics on non-crossing configurations (Q2449168) (← 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)