Pages that link to "Item:Q2448109"

The following pages link to On the largest convex subsets in Minkowski sums (Q2448109):

Displaying 9 items.

• Drawing graphs with vertices and edges in convex position (Q340526) (← links)
• A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
• Large convexly independent subsets of Minkowski sums (Q612927) (← links)
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
• Convexly independent subsets of the Minkowski sum of planar point sets (Q1010661) (← links)
• On the flatness of Minkowski sums (Q1847384) (← links)
• Convexly independent subsets of Minkowski sums of convex polygons (Q2032897) (← links)
• The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem (Q2033908) (← links)
• $ M$-strongly convex subsets and their generating sets (Q4515767) (← links)