On the number of crossing-free partitions

DOI10.1016/j.comgeo.2011.07.001zbMath1270.05034OpenAlexW2087925130WikidataQ54308591 ScholiaQ54308591MaRDI QIDQ359753

Andreas Razen, Ermo 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)

Cites Work

• Convexity minimizes pseudo-triangulations
• Analytic combinatorics of non-crossing configurations
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• On the number of plane geometric graphs
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Multidimensional Sorting
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Unnamed Item
• Unnamed Item
• Unnamed Item

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