Pages that link to "Item:Q443913"
From MaRDI portal
The following pages link to On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913):
Displaying 26 items.
- A lower bound on the crossing number of uniform hypergraphs (Q298946) (← 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)
- An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points (Q1792119) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs (Q2175816) (← 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)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- The rectilinear local crossing number of \(K_{n}\) (Q2363361) (← links)
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) (Q2385147) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- There is a unique crossing-minimal rectilinear drawing of \(K_{18}\) (Q2857403) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- The maximum number of halving lines and the rectilinear crossing number of for (Q3503562) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- Levi's Lemma, pseudolinear drawings of , and empty triangles (Q4638639) (← links)
- Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees (Q5237063) (← links)
- NOTE ON THE NUMBER OF OBTUSE ANGLES IN POINT SETS (Q5247060) (← links)
- New algorithms and bounds for halving pseudolines (Q5918765) (← links)
- From art and circuit design to geometry and combinatorics (Q6064580) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← 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)
- The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\) (Q6614724) (← links)
