Pages that link to "Item:Q4657586"

The following pages link to Convex quadrilaterals and \(k\)-sets (Q4657586):

Displaying 34 items.

• A lower bound on the crossing number of uniform hypergraphs (Q298946) (← links)
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
• Allowable interval sequences and separating convex sets in the plane (Q664360) (← links)
• On the crossing number of complete graphs (Q817025) (← links)
• Geometric drawings of \(K_{n}\) with few crossings (Q868888) (← links)
• Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
• The combinatorial encoding of disjoint convex sets in the plane (Q949781) (← 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)
• An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points (Q1792119) (← 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)
• The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
• \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) (Q2498933) (← links)
• A lower bound for the rectilinear crossing number (Q2573799) (← 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)
• Bishellable drawings of $K_n$ (Q4555043) (← links)
• (Q4558814) (← links)
• Extending Drawings of Complete Graphs into Arrangements of Pseudocircles (Q4992833) (← links)
• (Q5167143) (← 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)
• From art and circuit design to geometry and combinatorics (Q6064580) (← links)
• (Q6124757) (← 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)