The maximum number of unit distances in a convex n-gon
Journal of Combinatorial Theory Series A
An extremal problem on sparse 0-1 matrices
SIAM Journal on Discrete Mathematics
Davenport-Schnizel theory of matrices
Discrete Mathematics
Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences
European Journal of Combinatorics
Excluded permutation matrices and the Stanley-Wilf conjecture
Journal of Combinatorial Theory Series A
Forbidden patterns and unit distances
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Excluded permutation matrices and the Stanley-Wilf conjecture
Journal of Combinatorial Theory Series A
Hereditary properties of partitions, ordered graphs and ordered hypergraphs
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
Note: On linear forbidden submatrices
Journal of Combinatorial Theory Series A
Note: Extremal functions of forbidden double permutation matrices
Journal of Combinatorial Theory Series A
On nonlinear forbidden 0-1 matrices: a refutation of a Füredi-Hajnal conjecture
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
Journal of Combinatorial Theory Series A
On the structure and composition of forbidden sequences, with geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Origins of Nonlinearity in Davenport-Schinzel Sequences
SIAM Journal on Discrete Mathematics
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A
Hi-index | 0.00 |
We say that a 0-1 matrix A avoids another 0-1 matrix (pattern) P if no matrix P' obtained from P by increasing some of the entries is a submatrix of A. Following the lead of (SIAM J. Discrete Math. 4 (1991) 17-27; J. Combin. Theory Ser. A 55 (1990) 316-320; Discrete Math. 103 (1992) 233-251) and other papers we investigate n by n 0-1 matrices avoiding a pattern P and the maximal number ex(n, P) of 1 entries they can have. Finishing the work of [8] we find the order of magnitude of ex(n, P) for all patterns P with four 1 entries. We also investigate certain collections of excluded patterns. These sets often yield interesting extremal functions different from the functions obtained from any one of the patterns considered.