Linear bound on extremal functions of some forbidden patterns in 0-1 matrices
From MaRDI portal
Publication:1024495
DOI10.1016/J.DISC.2008.02.040zbMATH Open1193.05043OpenAlexW2080876227MaRDI QIDQ1024495FDOQ1024495
Publication date: 17 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.040
Boolean and Hadamard matrices (15B34) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Title not available (Why is that?)
- Davenport-Schinzel theory of matrices
- Excluded permutation matrices and the Stanley-Wilf conjecture
- A unified approach to visibility representations of planar graphs
- The maximum number of unit distances in a convex \(n\)-gon
- Representing a planar graph by vertical lines joining different levels
- Generalized Davenport-Schinzel sequences
- On 0-1 matrices and small excluded submatrices
- An Extremal Problem on Sparse 0-1 Matrices
- Forbidden patterns and unit distances
Cited In (9)
- Degrees of nonlinearity in forbidden 0-1 matrix problems
- An exact characterization of saturation for permutation matrices
- Almost all permutation matrices have bounded saturation functions
- Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
- Extremal functions of forbidden double permutation matrices
- Saturation Problems about Forbidden 0-1 Submatrices
- On the maximum density of 0-1 matrices with no forbidden rectangles
- Linear bounds on matrix extremal functions using visibility hypergraphs
- On the structure of matrices avoiding interval-minor patterns
This page was built for publication: Linear bound on extremal functions of some forbidden patterns in 0-1 matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024495)
