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

DOI10.1007/S00454-007-1325-8MaRDI QIDQ2385147zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article
• 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}\)
• scientific article; zbMATH DE number 2079388

Cited in

(24)

• New results on lower bounds for the number of (⩽ k)-facets
• The maximum number of halving lines and the rectilinear crossing number of for
• Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
• On Center Regions and Balls Containing Many Points
• Graph Drawing
• scientific article; zbMATH DE number 2145237 (Why is no real title available?)
• 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\)
• An extended lower bound on the number of( k)-edges to generalized configurations of points and the pseudolinear crossing number of K_n
• scientific article; zbMATH DE number 5555978 (Why is no real title available?)
• Bishellable drawings of $K_n$
• Maximum rectilinear crossing number of uniform hypergraphs
• An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
• scientific article; zbMATH DE number 2079388 (Why is no real title available?)
• On weighted sums of numbers of convex polygons in point sets
• \(k\)-sets and rectilinear crossings in complete uniform hypergraphs
• New results on lower bounds for the number of \((\leq k)\)-facets
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Extending drawings of complete graphs into arrangements of pseudocircles
• Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\)
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\)
• A lower bound for the rectilinear crossing number

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)