New lower bounds for the number of ( k)-edges and the rectilinear crossing number of K_n

DOI10.1007/S00454-007-1325-8zbMATH Open1126.52015OpenAlexW2113858653MaRDI QIDQ2385147FDOQ2385147

David Orden, J. García-López, Pedro Ramos, Oswin Aichholzer

Publication date: 11 October 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-007-1325-8

zbMATH Keywords

\(k\)-setsrectilinear crossing number\(\leq k\)-setshalving edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Erd?s problems and related topics of discrete geometry (52C10)

Cited In (22)

• New results on lower bounds for the number of (⩽ k)-facets
• The maximum number of halving lines and the rectilinear crossing number of for
• On Center Regions and Balls Containing Many Points
• Graph Drawing
• Extending Drawings of Complete Graphs into Arrangements of Pseudocircles
• Title not available (Why is that?)
• There is a unique crossing-minimal rectilinear drawing of \(K_{18}\)
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
• The 3-symmetric pseudolinear crossing number of \(K_{36}\)
• 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
• Title not available (Why is that?)
• An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
• Maximum rectilinear crossing number of uniform hypergraphs
• Bishellable drawings of $K_n$
• Title not available (Why is that?)
• An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
• On weighted sums of numbers of convex polygons in point sets
• New results on lower bounds for the number of \((\leq k)\)-facets
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill
• A lower bound for the rectilinear crossing number

   Recommendations

• Title not available (Why is that?) 👍 👎
• Graph Drawing 👍 👎
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) 👍 👎
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)

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