Touching perfect matchings and halving lines

DOI10.26493/1855-3974.1228.D7DzbMATH Open1411.05189OpenAlexW2886663700WikidataQ129386403 ScholiaQ129386403MaRDI QIDQ4629554FDOQ4629554

Authors: Micha A. Perles, Y. S. Kupitz, 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

Recommendations

• scientific article; zbMATH DE number 1241844
• On the number of perfect matchings of line graphs
• On perfect matchings of complements of line graphs
• On halving line arrangements
• Perfect matchings with crossings
• scientific article; zbMATH DE number 1455340
• Perfect matching and polymatroids
• Perfect matchings versus odd cuts
• Perfect matchings in hypergraphs and the Erdős matching conjecture
• Enumerating perfect matchings of a Halin graph

zbMATH Keywords

perfect matchingshalving linesbigraphscross-matching

Mathematics Subject Classification ID

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

Cites Work

• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Title not available (Why is that?)
• Some properties of components of bigraphs
• Crossing matchings and circuits have maximal length

Cited In (1)

• An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points

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

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