Pages that link to "Item:Q298946"

The following pages link to A lower bound on the crossing number of uniform hypergraphs (Q298946):

Displaying 6 items.

• A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
• The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem (Q2033908) (← links)
• \(k\)-sets and rectilinear crossings in complete uniform hypergraphs (Q2173451) (← links)
• Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs (Q2175816) (← links)
• On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
• Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)