The following pages link to Entering and leaving \(j\)-facets (Q5944934):
Displaying 11 items.
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- Stabbing simplices by points and flats (Q848667) (← links)
- In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions (Q1864131) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- The boustrophedon transform for descent polytopes (Q2421311) (← links)
- Deterministic Algorithms for Unique Sink Orientations of Grids (Q2817878) (← links)
- New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
- On Center Regions and Balls Containing Many Points (Q3511348) (← links)
- One line and n points (Q4446873) (← links)
- Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
- On the Monotone Upper Bound Problem (Q4818674) (← links)
