Pages that link to "Item:Q2498933"
From MaRDI portal
The following pages link to \(k\)-sets, convex quadrilaterals, and the rectilinear crossing number of \(K_{n}\) (Q2498933):
Displaying 14 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)
- On the average number of \(k\)-sets (Q1193707) (← links)
- An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points (Q1792119) (← 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 lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) (Q2385147) (← links)
- The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube (Q2825477) (← links)
- Convex quadrilaterals and \(k\)-sets (Q4657586) (← links)
- Graph Drawing (Q5711628) (← links)
- The 3-symmetric pseudolinear crossing number of \(K_{36}\) (Q6177413) (← links)