An Extremal Problem on Sparse 0-1 Matrices
From MaRDI portal
Publication:3971234
DOI10.1137/0404002zbMATH Open0752.05012OpenAlexW1994055767MaRDI QIDQ3971234FDOQ3971234
Authors: Daniel Bienstock, Ervin Győri 
Publication date: 25 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404002
Recommendations
- An extremal problem concerning matrices of 0's and 1 's
- On the determinant of a sparse 0-1 matrix
- Maximum determinant and permanent of sparse 0-1 matrices
- On very sparse circulant \((0,1)\) matrices
- On two extremal matrix problems
- Extermal positive semidefinite matrices with given sparsity pattern
- Some extremal problems concerning the square of a (0,1)-matrix
- Sparse 0−1 Matrices and Forbidden Hypergraphs
Cited In (28)
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- An exact characterization of saturation for permutation matrices
- Saturation of Multidimensional 0-1 Matrices
- Almost all permutation matrices have bounded saturation functions
- Interval minors of complete bipartite graphs
- Title not available (Why is that?)
- On linear forbidden submatrices
- Linear bound on extremal functions of some forbidden patterns in 0-1 matrices
- Extremal functions of forbidden double permutation matrices
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Ordered and convex geometric trees with linear extremal function
- Title not available (Why is that?)
- On the maximum density of 0-1 matrices with no forbidden rectangles
- On the determinant of a sparse 0-1 matrix
- Davenport-Schinzel theory of matrices
- Extremal functions of forbidden multidimensional matrices
- On the staircases of Gyárfás
- On forbidden submatrices
- On 0-1 matrices and small excluded submatrices
- On the structure of matrices avoiding interval-minor patterns
- Partitioning ordered hypergraphs
- A near-linear algorithm for the planar segment-center problem
- Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
- Forbidden paths and cycles in ordered graphs and matrices
- Sparse 0−1 Matrices and Forbidden Hypergraphs
- Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
- An extremal problem concerning matrices of 0's and 1 's
This page was built for publication: An Extremal Problem on Sparse 0-1 Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971234)
