Perfect matchings with crossings

DOI10.1007/978-3-031-06678-8_4OpenAlexW4285270640MaRDI QIDQ2169938

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

Publication date: 30 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06678-8_4

zbMATH Keywords

combinatorial geometrycrossingsperfect matchingsorder types

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Perfect matchings with crossings

Cites Work

• Unnamed Item
• Unnamed Item
• The clique problem in ray intersection graphs
• Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings
• 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
• Counting polygon triangulations is hard
• On the number of plane geometric graphs
• On the Number of Crossing‐Free Matchings, Cycles, and Partitions
• The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle