Pages that link to "Item:Q2573799"
From MaRDI portal
The following pages link to A lower bound for the rectilinear crossing number (Q2573799):
Displaying 34 items.
- On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Geometric drawings of \(K_{n}\) with few crossings (Q868888) (← links)
- An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) (Q958731) (← links)
- 3-symmetric and 3-decomposable geometric drawings of \(K_n\) (Q987669) (← links)
- New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428) (← links)
- Upper bounds for ropelength as a function of crossing number. (Q1421981) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- Point sets that minimize \((\leq k)\)-edges, 3-decomposable drawings, and the rectilinear crossing number of \(K_{30}\) (Q2275388) (← links)
- Weighted Turán problems with applications (Q2319696) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Bounds for Convex Crossing Numbers (Q3082956) (← links)
- New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
- The maximum number of halving lines and the rectilinear crossing number of for (Q3503562) (← links)
- A central approach to bound the number of crossings in a generalized configuration (Q3503564) (← links)
- On Center Regions and Balls Containing Many Points (Q3511348) (← links)
- (Q3625834) (← links)
- Bounds for rectilinear crossing numbers (Q4201390) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- Extending Drawings of Complete Graphs into Arrangements of Pseudocircles (Q4992833) (← links)
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
- Computational search of small point sets with small rectilinear crossing number (Q5494864) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
- Graph Drawing (Q5711628) (← links)
- New algorithms and bounds for halving pseudolines (Q5918765) (← links)
- (Q6124762) (← links)
- The 3-symmetric pseudolinear crossing number of \(K_{36}\) (Q6177413) (← links)
- There is a unique crossing-minimal rectilinear drawing of \(K_{18}\) (Q6545086) (← links)
- Deep cliques in point sets (Q6624183) (← links)