Davenport-Schinzel theory of matrices

From MaRDI portal
Publication:1195475

DOI10.1016/0012-365X(92)90316-8zbMath0776.05024OpenAlexW2037022974MaRDI QIDQ1195475

Péter Hajnal, Zoltan Fueredi

Publication date: 6 December 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90316-8




Related Items (61)

Pattern avoidance over a hypergraphThe length of an s-increasing sequence of r-tuplesAn exact characterization of saturation for permutation matricesCounting ordered graphs that avoid certain subgraphsSaturation of Multidimensional 0-1 MatricesAlmost all permutation matrices have bounded saturation functionsGeometric graphs with no self-intersecting path of length threeTilings in vertex ordered graphsGeneralized Davenport-Schinzel sequencesPolynomial removal lemmas for ordered graphsThree Generalizations of Davenport--Schinzel SequencesFast Property Testing and Metrics for PermutationsHereditary properties of partitions, ordered graphs and ordered hypergraphsInterval Minors of Complete Bipartite GraphsExtensions of the linear bound in the Füredi-Hajnal conjectureOn the Turán number of some ordered even cyclesExcluded permutation matrices and the Stanley-Wilf conjectureExtremal functions of forbidden multidimensional matricesEdge-ordered Ramsey numbersBijective enumerations of \(\Gamma\)-free \(0\)-\(1\) matricesBipartite Turán problems for ordered graphsForbidden formations in multidimensional 0-1 matricesGeodesic packing in graphsBounds on parameters of minimally nonlinear patternsDegrees of nonlinearity in forbidden 0-1 matrix problemsExtremal functions of excluded tensor products of permutation matricesOrdered and convex geometric trees with linear extremal functionLonesum and \(\Gamma\)-free \(0-1\) fillings of Ferrers shapesTurán problems for edge-ordered graphsForbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet ProblemsTight bounds on the maximum size of a set of permutations with bounded VC-dimensionSharper bounds and structural results for minimally nonlinear 0-1 matricesExtremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequencesCounting configuration-free sets in groupsOrdered Ramsey numbersEqual entries in totally positive matricesForbidden configurations and product constructionsPattern-avoiding \(( 0 , 1 )\)-matrices and bases of permutation matrices\(L_ 1\) shortest paths among polygonal obstacles in the planeRamsey numbers of ordered graphsCounting configuration-free sets in groupsForbidden paths and cycles in ordered graphs and matricesForbidden Berge hypergraphsA tournament approach to pattern avoiding matricesPartitioning ordered hypergraphsGeneralized Davenport-Schinzel sequences and their 0-1 matrix counterpartsOn the Turán number of ordered forestsOn the Turán number of ordered forestsOn the structure of matrices avoiding interval-minor patternsLinear bounds on matrix extremal functions using visibility hypergraphsOn linear forbidden submatricesOn constants in the Füredi-Hajnal and the Stanley-Wilf conjectureSaturation Problems about Forbidden 0-1 SubmatricesA note on a Ramsey-type problem for sequencesLinear bound on extremal functions of some forbidden patterns in 0-1 matricesAsymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settingsExtremal functions of forbidden double permutation matricesOn 0-1 matrices and small excluded submatricesRamsey numbers of interval 2-chromatic ordered graphsLarge Homogeneous SubmatricesUnnamed Item



Cites Work


This page was built for publication: Davenport-Schinzel theory of matrices