scientific article; zbMATH DE number 2145237
From MaRDI portal
Publication:4657586
zbMath1071.05028MaRDI QIDQ4657586
Katalin Vesztergombi, László Lovász, Ermo Welzl, Uli Wagner
Publication date: 14 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geometric probability and stochastic geometry (60D05) Planar graphs; geometric and topological aspects of graph theory (05C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items (27)
A lower bound on the crossing number of uniform hypergraphs ⋮ Bishellable drawings of $K_n$ ⋮ The 2-page crossing number of \(K_{n}\) ⋮ Geometric drawings of \(K_{n}\) with few crossings ⋮ Abstract order type extension and new results on the rectilinear crossing number ⋮ From art and circuit design to geometry and combinatorics ⋮ New results on lower bounds for the number of (⩽ k)-facets ⋮ The maximum number of halving lines and the rectilinear crossing number of for ⋮ A central approach to bound the number of crossings in a generalized configuration ⋮ On Center Regions and Balls Containing Many Points ⋮ The 3-symmetric pseudolinear crossing number of \(K_{36}\) ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Allowable interval sequences and separating convex sets in the plane ⋮ The combinatorial encoding of disjoint convex sets in the plane ⋮ An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ New algorithms and bounds for halving pseudolines ⋮ Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\) ⋮ 3-symmetric and 3-decomposable geometric drawings of \(K_n\) ⋮ Extending Drawings of Complete Graphs into Arrangements of Pseudocircles ⋮ New results on lower bounds for the number of \((\leq k)\)-facets ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ A lower bound for the rectilinear crossing number ⋮ On the crossing number of complete graphs
This page was built for publication:
