scientific article
From MaRDI portal
Publication:3625834
zbMATH Open1167.05015arXivmath/0608610MaRDI QIDQ3625834FDOQ3625834
Authors: Oswin Aichholzer, J. García-López, David Orden, Pedro Ramos 
Publication date: 22 May 2009
Full work available at URL: https://arxiv.org/abs/math/0608610
Title of this publication is not available (Why is that?)
Recommendations
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
- Toward the rectilinear crossing number of \(K _{n}\): New drawings, upper bounds, and asymptotics
- An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
- A lower bound for the rectilinear crossing number
- Graph Drawing
- The rectilinear crossing number of \(K_n\): closing in (or are we?)
- A new lower bound for the bipartite crossing number with applications
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Computing and Combinatorics
- New bounds on the edge number of ak-map graph
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)
Cited In (7)
- New results on lower bounds for the number of (⩽ k)-facets
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)
- An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\)
- An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
- New results on lower bounds for the number of \((\leq k)\)-facets
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\)
- A lower bound for the rectilinear crossing number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625834)
