Perfect matchings with crossings

DOI10.1007/s00453-023-01147-7OpenAlexW4384698608MaRDI QIDQ6119827

Daniel Perz, Oswin Aichholzer, Ruy Fabila-Monroy, Birgit Vogtenhuber, Rosna Paul, Irene Parada, Patrick Schnider, Philipp Kindermann

Publication date: 25 March 2024

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-023-01147-7

zbMATH Keywords

combinatorial geometrygeometric graphscrossingsperfect matchingsorder types

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clique problem in ray intersection graphs
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• Crossing families
• Improved bounds for planar \(k\)-sets and related problems
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Point sets with many non-crossing perfect matchings
• Enumerating order types for small point sets with applications
• Planar point sets determine many pairwise crossing segments
• On crossing-families in planar point sets
• Perfect matchings with crossings
• Counting polygon triangulations is hard
• On the number of plane geometric graphs
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• A central approach to bound the number of crossings in a generalized configuration
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle

This page was built for publication: Perfect matchings with crossings