Davenport-Schinzel theory of matrices
From MaRDI portal
Publication:1195475
DOI10.1016/0012-365X(92)90316-8zbMath0776.05024MaRDI QIDQ1195475
Publication date: 6 December 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
15B33: Matrices over special rings (quaternions, finite fields, etc.)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Excluded permutation matrices and the Stanley-Wilf conjecture, Hereditary properties of partitions, ordered graphs and ordered hypergraphs, On linear forbidden submatrices, On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture, 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, Generalized Davenport-Schinzel sequences, Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, Geometric graphs with no self-intersecting path of length three, Forbidden paths and cycles in ordered graphs and matrices, On 0-1 matrices and small excluded submatrices, Extensions of the linear bound in the Füredi-Hajnal conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Almost linear upper bounds on the length of general Davenport-Schinzel sequences
- A simplified construction of nonlinear Davenport-Schinzel sequences
- The maximum number of unit distances in a convex \(n\)-gon
- An Extremal Problem on Sparse 0-1 Matrices
- On a problem of Davenport and Schinzel
- On Graphs that do not Contain a Thomsen Graph
- A combinatorial problem connected with differential equations II
- On a problem of K. Zarankiewicz
- On the structure of linear graphs
