Pages that link to "Item:Q4859605"

The following pages link to The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability (Q4859605):

Displaying 13 items.

• 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)
• The probability that the number of points on a complete intersection is squarefree (Q1697467) (← links)
• Approximating the rectilinear crossing number (Q2331210) (← links)
• Approximating the Rectilinear Crossing Number (Q2961535) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• Convex quadrilaterals and \(k\)-sets (Q4657586) (← links)
• Limiting Crossing Numbers for Geodesic Drawings on the Sphere (Q5014128) (← links)
• Graph Drawing (Q5711628) (← links)
• From art and circuit design to geometry and combinatorics (Q6064580) (← links)
• On book crossing numbers of the complete graph (Q6552472) (← links)
• Automated mathematical discovery and verification: minimizing pentagons in the plane (Q6648153) (← links)