Pages that link to "Item:Q2362105"
From MaRDI portal
The following pages link to On the rectilinear crossing number of complete uniform hypergraphs (Q2362105):
Displaying 5 items.
- A lower bound on the crossing number of uniform hypergraphs (Q298946) (← links)
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs (Q2173451) (← links)
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs (Q2175816) (← links)
- The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability (Q4859605) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)