On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
type: Item
instance of: scholarly article
title: On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
zbMATH Open document ID: 1247.52010
author: M. Cetina
author: Silvia Fernández-Merchant
author: B. M. Ábrego
author: J. Leaños
author: Gelasio Salazar
published in: Discrete \& Computational Geometry
publication date: 2012-08-13T00:00:00Z
Mathematics Subject Classification ID: 52C10
zbMATH DE Number: 6065211
zbMATH Keywords: \(k\)-edges
zbMATH Keywords: \(k\)-sets
zbMATH Keywords: halving lines
zbMATH Keywords: rectilinear crossing numbers
zbMATH Keywords: allowable sequences
zbMATH Keywords: geometric drawings
MaRDI profile type: Publication
full work available at URL: s00454-012-9403-y
OpenAlex ID: W1670552514
cites work: An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
cites work: 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
cites work: The maximum number of halving lines and the rectilinear crossing number of for
cites work: A central approach to bound the number of crossings in a generalized configuration
cites work: Geometric drawings of \(K_{n}\) with few crossings
cites work: A lower bound for the rectilinear crossing number
cites work: Abstract order type extension and new results on the rectilinear crossing number
cites work: New results on lower bounds for the number of (⩽ k)-facets
cites work: New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
cites work: \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)
cites work: On halving line arrangements
cites work: Research Problems in Discrete Geometry
cites work: Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)
cites work: Improved bounds for planar \(k\)-sets and related problems
cites work: Q5672661
cites work: Crossing Number Problems
cites work: On the combinatorial classification of nondegenerate configurations in the plane
cites work: Q5620616
cites work: Q5641161
cites work: Q4657586
cites work: Q3514526
cites work: Improving the crossing lemma by finding more crossings in sparse graphs
cites work: A characterization of planar graphs by pseudo-line arrangements
cites work: Point sets with many \(k\)-sets
cites work: More on k-sets of finite sets in the plane
DOI: 10.1007/S00454-012-9403-Y
description: scientific article; zbMATH DE number 6065211