Touching perfect matchings and halving lines

DOI10.26493/1855-3974.1228.d7dzbMath1411.05189OpenAlexW2886663700WikidataQ129386403 ScholiaQ129386403MaRDI QIDQ4629554

Yaakov S. Kupitz, Micha A. Perles, Horst Martini

Publication date: 27 March 2019

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.1228.d7d

zbMATH Keywords

perfect matchingshalving linesbigraphscross-matching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Some properties of components of bigraphs
• Crossing matchings and circuits have maximal length

This page was built for publication: Touching perfect matchings and halving lines