Crossing-free perfect matchings in wheel point sets

DOI10.1007/978-3-319-44479-6_30MaRDI QIDQ4604397zbMATHOpenAlexFDO

Authors Andres J. Ruiz-Vargas, Emo Welzl

Publication date 26 February 2018

Published in A Journey Through Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44479-6_30

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Recommendations

• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Point sets with many non-crossing perfect matchings
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• Packing plane perfect matchings into a point set
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices

Cites work

• scientific article; zbMATH DE number 3882232 (Why is no real title available?)
• scientific article; zbMATH DE number 2068119 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• A Generalization of Radon's Theorem
• A continuous analogue of the upper bound theorem
• Approximating the bottleneck plane perfect matching of a point set
• Bichromatic compatible matchings
• Catalan Numbers
• Compatible geometric matchings
• Counting and enumerating crossing-free geometric graphs
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• Entering and leaving \(j\)-facets
• Enumerating order types for small point sets with applications
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• Graphs of triangulations and perfect matchings
• Lectures on Polytopes
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Multidimensional Sorting
• Non-crossing matchings of points with geometric objects
• On a triangle counting problem
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Order on order types
• Packing plane perfect matchings into a point set
• Peeling and nibbling the cactus: subexponential-time algorithms for counting triangulations and related problems
• Point sets with many non-crossing perfect matchings
• Points surrounding the origin
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

Cited in

(5)

• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Tukey depth histograms
• Point sets with many non-crossing perfect matchings

This page was built for publication: Crossing-free perfect matchings in wheel point sets

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