Bounds on parameters of minimally nonlinear patterns

zbMath1386.05191arXiv1701.00706MaRDI QIDQ1691099

P. A. CrowdMath

Publication date: 15 January 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.00706

zbMATH Keywords

extremal functionspattern avoidance0-1 matricesordered graphsgeneralized Davenport-Schinzel sequencesminimally non-linear

Mathematics Subject Classification ID

Extremal combinatorics (05D99)

Related Items (3)

Almost all permutation matrices have bounded saturation functions ⋮ Sharper bounds and structural results for minimally nonlinear 0-1 matrices ⋮ On the structure of matrices avoiding interval-minor patterns

Cites Work

• Unnamed Item
• Unnamed Item
• Degrees of nonlinearity in forbidden 0-1 matrix problems
• Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
• Excluded permutation matrices and the Stanley-Wilf conjecture
• New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
• On linear forbidden submatrices
• Extremal functions of forbidden double permutation matrices
• Davenport-Schinzel theory of matrices
• The maximum number of unit distances in a convex \(n\)-gon
• 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
• Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
• The Number of Edges in $k$-Quasi-planar Graphs
• A Combinatorial Problem Connected with Differential Equations

This page was built for publication: Bounds on parameters of minimally nonlinear patterns