Saturation of Multidimensional 0-1 Matrices
From MaRDI portal
Recommendations
Cites work
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Almost all permutation matrices have bounded saturation functions
- An Extremal Problem on Sparse 0-1 Matrices
- Davenport-Schinzel theory of matrices
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Extremal functions of forbidden double permutation matrices
- Extremal functions of forbidden multidimensional matrices
- scientific article; zbMATH DE number 1504588 (Why is no real title available?)
- On 0-1 matrices and small excluded submatrices
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
- Pattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices
- Saturation problems about forbidden 0-1 submatrices
- The maximum number of unit distances in a convex n-gon
- Two properties of maximal antichains in strict chain product posets
Cited in
(6)- scientific article; zbMATH DE number 1139703 (Why is no real title available?)
- Saturation of multidimensional 0-1 matrices
- Multidimensional threshold matrices and extremal matrices of order 2
- Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
- Sequence saturation
- Almost all permutation matrices have bounded saturation functions
This page was built for publication: Saturation of Multidimensional 0-1 Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889965)
