On the number of crossing-free partitions

DOI10.1016/J.COMGEO.2011.07.001zbMATH Open1270.05034OpenAlexW2087925130WikidataQ54308591 ScholiaQ54308591MaRDI QIDQ359753FDOQ359753

Authors Andreas Razen, Emo Welzl

Publication date 22 August 2013

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0925772111000599

zbMATH Keywords

countingcrossing-free geometric graphscrossing-free partitions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the number of disjoint convex quadrilaterals for a planar point set
• On a partition into convex polygons
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• scientific article; zbMATH DE number 1150145

Cites work

• scientific article; zbMATH DE number 1409186 (Why is no real title available?)
• scientific article; zbMATH DE number 3368644 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• Analytic combinatorics of non-crossing configurations
• Convexity minimizes pseudo-triangulations
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Multidimensional Sorting
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• On the number of plane geometric graphs
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)

Cited in

(2)

• Partitions with \(k\) crossings
• Crossings and nestings in set partitions of classical types

This page was built for publication: On the number of crossing-free partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359753)