Pages that link to "Item:Q1039428"
From MaRDI portal
The following pages link to New results on lower bounds for the number of \((\leq k)\)-facets (Q1039428):
Displaying 4 items.
- \(k\)-sets and rectilinear crossings in complete uniform hypergraphs (Q2173451) (← links)
- How many simplices are needed to triangulate a Grassmannian? (Q2236456) (← links)
- Energy Considerations for the Stabilization of Constrained Mechanical Systems with Velocity Projection (Q3003923) (← links)
- Deep cliques in point sets (Q6624183) (← links)
