Crossing-free perfect matchings in wheel point sets

DOI10.1007/978-3-319-44479-6_30zbMATH Open1387.05034OpenAlexW2761584990MaRDI QIDQ4604397FDOQ4604397

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

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

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Cites Work

• Lectures on Polytopes
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• Non-crossing matchings of points with geometric objects
• Title not available (Why is that?)
• Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
• Catalan Numbers
• A Generalization of Radon's Theorem
• Multidimensional Sorting
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Enumerating order types for small point sets with applications
• Entering and leaving \(j\)-facets
• Points surrounding the origin
• Graphs of triangulations and perfect matchings
• Title not available (Why is that?)
• Counting and Enumerating Crossing-free Geometric Graphs
• Compatible geometric matchings
• A continuous analogue of the upper bound theorem
• Point sets with many non-crossing perfect matchings
• Approximating the bottleneck plane perfect matching of a point set
• On a triangle counting problem
• Order on Order Types
• Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
• Bichromatic compatible matchings
• From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

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

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)