Pages that link to "Item:Q2385147"

The following pages link to New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) (Q2385147):

Displayed 15 items.

• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) ‎ (← 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)
• On weighted sums of numbers of convex polygons in point sets (Q2167313) ‎ (← 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)
• 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)
• On Center Regions and Balls Containing Many Points (Q3511348) ‎ (← links)
• Bishellable drawings of $K_n$ (Q4555043) ‎ (← links)
• Extending Drawings of Complete Graphs into Arrangements of Pseudocircles (Q4992833) ‎ (← links)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) ‎ (← links)
• Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) ‎ (← links)
• The 3-symmetric pseudolinear crossing number of \(K_{36}\) (Q6177413) ‎ (← links)